Encoder, decoder, encoding method, and decoding method

ABSTRACT

An encoder including circuitry and memory coupled to the circuitry. In both of a first case where an orthogonal transform is performed and a second case where the orthogonal transform is skipped, when a number of CABAC processes is within an allowable range, the circuitry: encodes a plurality of coefficient information flags by CABAC; and encodes a remainder value of the coefficient; and when the number of CABAC processes is not within the allowable range, the circuitry: skips the encoding of the plurality of coefficient information flags, wherein in the first case, the circuitry: converts the coefficient to a second coefficient by using a poszero value that is determined using a plurality of surrounding coefficients; and encodes a value of the second coefficient, and wherein in the second case, the circuitry: encodes the value of the coefficient.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a U.S. continuation application of PCT International Patent Application Number PCT/JP2020/022634 filed on Jun. 9, 2020, claiming the benefit of priority of U.S. Provisional Patent Application No. 62/861,653 filed on Jun. 14, 2019, the entire contents of which are hereby incorporated by reference.

BACKGROUND 1. Technical Field

The present disclosure relates to video coding, and relates to, for example, systems, constituent elements, methods, etc. in encoding and decoding of videos.

2. Description of the Related Art

The video coding technology has been developed from H.261 and MPEG-1 to H.264/AVC (Advanced Video Coding), MPEG-LA, H.265 (ISO/IEC 23008-2 HEVC)/HEVC (High Efficiency Video Coding), and H.266/VVC (Versatile Video Codec). With this development, it is always required to improve and optimize video coding technology in order to process digital video data the amount of which has kept increasing in various kinds of applications.

It is to be noted that Non-patent Literature relates to one example of a conventional standard related to the above-described video coding technology.

SUMMARY

For example, an encoder according to an aspect of the present disclosure includes circuitry and memory coupled to the circuitry, wherein: in both of a first case where an orthogonal transform is performed and a second case where the orthogonal transform is skipped in residual coding of a current block, when a number of Context-based Adaptive Binary Arithmetic Coding (CABAC) processes is within an allowable range, the circuitry: encodes a plurality of coefficient information flags by CABAC, each of the plurality of coefficient information flags relating to a coefficient included in the current block; and encodes a remainder value of the coefficient with Golomb-Rice code; and when the number of CABAC processes is not within the allowable range, the circuitry: skips the encoding of the plurality of coefficient information flags, wherein in the first case where the orthogonal transform is performed, the circuitry: converts the coefficient to a second coefficient by using a poszero value that is determined using a plurality of surrounding coefficients of the coefficient within the current block; and encodes a value of the second coefficient with the Golomb-Rice code, and wherein in the second case where the orthogonal transform is skipped, the circuitry: encodes the value of the coefficient with the Golomb-Rice code.

Some of implementations of embodiments according to the present disclosure may: improve coding efficiency; simplify an encoding/decoding process; increase an encoding and/or decoding speed; and efficiently select appropriate components/operations to be used for encoding and decoding, such as appropriate filters, block sizes, motion vectors, reference pictures, reference blocks, etc.

Further benefits and advantages according to an aspect of the present disclosure will become apparent from the DESCRIPTION and the Drawings. These benefits and advantages are obtainable by features described in some embodiments, the DESCRIPTION, and the Drawings. However, all the features do not always need to be provided to obtain one or more of the advantages and/or effects.

It is to be noted that these general or specific aspects may be implemented as a system, a method, an integrated circuit, a computer program, a recording medium, or any combination of these.

BRIEF DESCRIPTION OF DRAWINGS

These and other objects, advantages and features of the disclosure will become apparent from the following description thereof taken in conjunction with the accompanying drawings that illustrate a specific embodiment of the present disclosure.

FIG. 1 is a block diagram illustrating a configuration of an encoder according to an embodiment;

FIG. 2 is a flow chart indicating one example of an overall encoding process performed by the encoder;

FIG. 3 is a conceptual diagram illustrating one example of block splitting;

FIG. 4A is a conceptual diagram illustrating one example of a slice configuration;

FIG. 4B is a conceptual diagram illustrating one example of a tile configuration;

FIG. 5A is a chart indicating transform basis functions for various transform types;

FIG. 5B is a conceptual diagram illustrating example spatially varying transforms (SVT);

FIG. 6A is a conceptual diagram illustrating one example of a filter shape used in an adaptive loop filter (ALF);

FIG. 6B is a conceptual diagram illustrating another example of a filter shape used in an ALF;

FIG. 6C is a conceptual diagram illustrating another example of a filter shape used in an ALF;

FIG. 7 is a block diagram indicating one example of a specific configuration of a loop filter which functions as a deblocking filter (DBF);

FIG. 8 is a conceptual diagram indicating an example of a deblocking filter having a symmetrical filtering characteristic with respect to a block boundary;

FIG. 9 is a conceptual diagram for illustrating a block boundary on which a deblocking filter process is performed;

FIG. 10 is a conceptual diagram indicating examples of Bs values;

FIG. 11 is a flow chart illustrating one example of a process performed by a prediction processor of the encoder;

FIG. 12 is a flow chart illustrating another example of a process performed by the prediction processor of the encoder;

FIG. 13 is a flow chart illustrating another example of a process performed by the prediction processor of the encoder;

FIG. 14 is a conceptual diagram illustrating sixty-seven intra prediction modes used in intra prediction in an embodiment;

FIG. 15 is a flow chart illustrating an example basic processing flow of inter prediction;

FIG. 16 is a flow chart illustrating one example of derivation of motion vectors;

FIG. 17 is a flow chart illustrating another example of derivation of motion vectors;

FIG. 18 is a flow chart illustrating another example of derivation of motion vectors;

FIG. 19 is a flow chart illustrating an example of inter prediction in normal inter mode;

FIG. 20 is a flow chart illustrating an example of inter prediction in merge mode;

FIG. 21 is a conceptual diagram for illustrating one example of a motion vector derivation process in merge mode;

FIG. 22 is a flow chart illustrating one example of frame rate up conversion (FRUC) process;

FIG. 23 is a conceptual diagram for illustrating one example of pattern matching (bilateral matching) between two blocks along a motion trajectory;

FIG. 24 is a conceptual diagram for illustrating one example of pattern matching (template matching) between a template in a current picture and a block in a reference picture;

FIG. 25A is a conceptual diagram for illustrating one example of deriving a motion vector of each sub-block based on motion vectors of a plurality of neighboring blocks;

FIG. 25B is a conceptual diagram for illustrating one example of deriving a motion vector of each sub-block in affine mode in which three control points are used;

FIG. 26A is a conceptual diagram for illustrating an affine merge mode;

FIG. 26B is a conceptual diagram for illustrating an affine merge mode in which two control points are used;

FIG. 26C is a conceptual diagram for illustrating an affine merge mode in which three control points are used;

FIG. 27 is a flow chart illustrating one example of a process in affine merge mode;

FIG. 28A is a conceptual diagram for illustrating an affine inter mode in which two control points are used;

FIG. 28B is a conceptual diagram for illustrating an affine inter mode in which three control points are used;

FIG. 29 is a flow chart illustrating one example of a process in affine inter mode;

FIG. 30A is a conceptual diagram for illustrating an affine inter mode in which a current block has three control points and a neighboring block has two control points;

FIG. 30B is a conceptual diagram for illustrating an affine inter mode in which a current block has two control points and a neighboring block has three control points;

FIG. 31A is a flow chart illustrating a merge mode process including decoder motion vector refinement (DMVR);

FIG. 31B is a conceptual diagram for illustrating one example of a DMVR process;

FIG. 32 is a flow chart illustrating one example of generation of a prediction image;

FIG. 33 is a flow chart illustrating another example of generation of a prediction image;

FIG. 34 is a flow chart illustrating another example of generation of a prediction image;

FIG. 35 is a flow chart illustrating one example of a prediction image correction process performed by an overlapped block motion compensation (OBMC) process;

FIG. 36 is a conceptual diagram for illustrating one example of a prediction image correction process performed by an OBMC process;

FIG. 37 is a conceptual diagram for illustrating generation of two triangular prediction images;

FIG. 38 is a conceptual diagram for illustrating a model assuming uniform linear motion;

FIG. 39 is a conceptual diagram for illustrating one example of a prediction image generation method using a luminance correction process performed by a local illumination compensation (LIC) process;

FIG. 40 is a block diagram illustrating a mounting example of the encoder;

FIG. 41 is a block diagram illustrating a configuration of a decoder according to an embodiment;

FIG. 42 is a flow chart illustrating one example of an overall decoding process performed by the decoder;

FIG. 43 is a flow chart illustrating one example of a process performed by a prediction processor of the decoder;

FIG. 44 is a flow chart illustrating another example of a process performed by the prediction processor of the decoder;

FIG. 45 is a flow chart illustrating an example of inter prediction in normal inter mode in the decoder;

FIG. 46 is a block diagram illustrating a mounting example of the decoder;

FIG. 47 is a flow chart indicating a basic coefficient encoding method according to Aspect 1;

FIG. 48 is a flow chart indicating a basic first encoding scheme according to Aspect 1;

FIG. 49 is a flow chart indicating a basic second encoding scheme according to Aspect 1;

FIG. 50 is a flow chart indicating a coefficient encoding method according to a first example in Aspect 1;

FIG. 51 is a flow chart indicating a coefficient encoding method according to a second example in Aspect 1;

FIG. 52 is a flow chart indicating a coefficient encoding method according to a first example in Aspect 2;

FIG. 53 is a flow chart indicating a coefficient encoding method according to a second example in Aspect 2;

FIG. 54 is a syntax diagram indicating a basic first encoding scheme according to Aspect 3;

FIG. 55 is a syntax diagram indicating a basic second encoding scheme according to Aspect 3;

FIG. 56 is a syntax diagram indicating a second encoding scheme according to a first example in Aspect 3;

FIG. 57 is a syntax diagram indicating a second encoding scheme according to a second example in Aspect 3;

FIG. 58 is a relationship diagram indicating basic correspondences between coefficient information flags and context numbers according to Aspect 4;

FIG. 59 is a conceptual diagram indicating basic neighboring coefficients according to Aspect 4;

FIG. 60 is a conceptual diagram indicating neighboring coefficients according to a first example in Aspect 4;

FIG. 61A is a conceptual diagram indicating a current coefficient to be encoded that is present in a position in an edge in a horizontal direction;

FIG. 61B is a conceptual diagram indicating the current coefficient to be encoded that is present in a position in an edge in a vertical direction;

FIG. 62A is a conceptual diagram indicating a current coefficient to be encoded that is present neighboring a position in an edge in a horizontal direction;

FIG. 62B is a conceptual diagram indicating a current coefficient to be encoded that is present neighboring a position in an edge in a vertical direction;

FIG. 63 is a conceptual diagram indicating correspondences between residual values and Golomb-Rice code according to a third example in Aspect 4;

FIG. 64 is a flow chart indicating a basic coefficient encoding method according to Aspect 5;

FIG. 65 is a flow chart indicating a third encoding scheme according to Aspect 5;

FIG. 66 is a conceptual diagram indicating neighboring coefficients according to Aspect 5;

FIG. 67 is a conceptual diagram indicating a conversion process according to Aspect 5;

FIG. 68 is a flow chart indicating a coefficient encoding method according to a first example in Aspect 5;

FIG. 69 is a flow chart indicating a coefficient encoding method according to a second example in Aspect 5;

FIG. 70 is a flowchart indicating an operation by an encoder according to an embodiment;

FIG. 71 is a flowchart indicating an operation by a decoder according to the embodiment;

FIG. 72 is a block diagram illustrating an overall configuration of a content providing system for implementing a content distribution service;

FIG. 73 is a conceptual diagram illustrating one example of an encoding structure in scalable encoding;

FIG. 74 is a conceptual diagram illustrating one example of an encoding structure in scalable encoding;

FIG. 75 is a conceptual diagram illustrating an example of a display screen of a web page;

FIG. 76 is a conceptual diagram illustrating an example of a display screen of a web page;

FIG. 77 is a block diagram illustrating one example of a smartphone; and

FIG. 78 is a block diagram illustrating an example of a configuration of a smartphone.

DETAILED DESCRIPTION OF THE EMBODIMENTS

For example, there is a case where an encoder is capable of transforming a block in an image into data to be easily compressed, by applying orthogonal transform to the block in encoding of the block. There is another case where the encoder is capable of reducing processing delay by not applying orthogonal transform to a block in an image in encoding of the block.

The properties of the block to which orthogonal transform has been applied and the properties of the block to which no orthogonal transform has been applied are different from each other. The encoding scheme for use in the block to which orthogonal transform has been applied and the encoding scheme for use in the block to which no orthogonal transform has been applied may be different from each other.

However, in the case where inappropriate encoding scheme has been used for a block to which orthogonal transform has been applied or in the case where inappropriate encoding scheme has been used for a block to which no orthogonal transform has been applied, there is a possibility that, for example, the amount of codes may increase, or the processing delay may increase. Furthermore, in the case where the encoding scheme that is used for the block to which orthogonal transform has been applied and the encoding scheme that is used for the block to which no orthogonal transform has been applied are significantly different, there is a possibility that the processing becomes complex or the circuit scale increases.

In view of this, an encoder according to an aspect of the present disclosure includes circuitry and memory coupled to the circuitry. In operation, the circuitry limits a total number of processes of context adaptive coding, and encodes a block in an image; and when encoding the block, in both a case where orthogonal transform is applied to the block, and a case where no orthogonal transform is applied to the block, encodes a coefficient information flag by context adaptive coding when the total number of processes is within an allowable range for the total number of processes, the coefficient information flag indicating an attribute of a coefficient included in the block, skips encoding of the coefficient information flag when the total number of processes is not within the allowable range for the total number of processes, encodes remainder value information by Golomb-rice coding when the coefficient information flag is encoded, the remainder value information being for reconstructing a value of the coefficient using the coefficient information flag, when the encoding of the coefficient information flag is skipped in the case where orthogonal transform is applied to the block, performs a conversion process for converting the value of the coefficient using a value determined using a neighboring coefficient which is a coefficient that neighbors a position of the coefficient in the block, and encodes the value of the coefficient by Golomb-rice coding, and when the encoding of the coefficient information flag is skipped in the case where no orthogonal transform is applied to the block, skips performing the conversion process, and encodes the value of the coefficient by Golomb-rice coding.

In this way, there is a possibility that encoding of the coefficient information flag is skipped regardless of application or non-application of orthogonal transform and the limitation on the total number of processes of context adaptive coding. Thus, there is a possibility that increase in processing delay is reduced and increase in the amount of codes is reduced. In addition, there is a possibility that the difference between the encoding scheme used for a block to which orthogonal transform is applied and the encoding scheme used for a block to which no orthogonal transform is applied is reduced, and the circuit scale is reduced.

Furthermore, whether or not to convert the value of the coefficient is appropriately controlled using the neighboring coefficient, which produces a possibility that increase in processing delay is reduced and a possibility that increase in the amount of codes is reduced.

In addition, for example, the coefficient information flag is a flag indicating whether or not the value of the coefficient is greater than 1.

In this way, there is a possibility that encoding of the coefficient information flag indicating whether or not the value of the coefficient is greater than 1 is skipped according to the limitation on the total number of processes of context adaptive coding regardless of application or non-application of orthogonal transform. Thus, there is a possibility that increase in processing delay is reduced and increase in the amount of codes is reduced.

In addition, for example, the conversion process includes: replacing the value of the coefficient with the value determined using the neighboring coefficient when the value of the coefficient is 0; and decreases the value of the coefficient by subtracting 1 from the value of the coefficient when the value of the coefficient is greater than 0 and less than or equal to the value determined using the neighboring coefficient.

In this way, the value of the coefficient is appropriately converted according to the neighboring coefficient, which produces a possibility that increase in the amount of codes is reduced.

Furthermore, for example, a decoder according to an aspect of the present disclosure includes circuitry and memory coupled to the circuitry. In operation, the circuitry limits a total number of processes of context adaptive decoding, and decodes a block in an image; and when decoding the block, in both a case where inverse orthogonal transform is applied to the block, and a case where no inverse orthogonal transform is applied to the block, decodes a coefficient information flag by context adaptive decoding when the total number of processes is within an allowable range for the total number of processes, the coefficient information flag indicating an attribute of a coefficient included in the block, skips decoding of the coefficient information flag when the total number of processes is not within the allowable range for the total number of processes, decodes remainder value information by Golomb-rice decoding when the coefficient information flag is decoded, the remainder value information being for reconstructing a value of the coefficient, and derives the value of the coefficient using the coefficient information flag and the remainder value information using the coefficient information flag, when the decoding of the coefficient information flag is skipped in the case where inverse orthogonal transform is applied to the block, decodes the value of the coefficient by Golomb-rice decoding, performs a conversion process for converting the value of the coefficient using a value determined using a neighboring coefficient which is a coefficient that neighbors a position of the coefficient in the block, and derives the value of the coefficient, and when the decoding of the coefficient information flag is skipped in the case where no inverse orthogonal transform is applied to the block, decodes the value of the coefficient by Golomb-rice decoding, skips performing the conversion process, and derives the value of the coefficient by Golomb-rice decoding.

In this way, there is a possibility that the coefficient information flag is decoded by context adaptive decoding regardless of application or non-application of inverse (reverse) orthogonal transform and the limitation on the total number of processes of context adaptive decoding. Thus, there is a possibility that increase in processing delay is reduced and increase in the amount of codes is reduced. In addition, there is a possibility that the difference between the decoding scheme used for a block to which inverse orthogonal transform is applied and the decoding scheme used for a block to which no inverse orthogonal transform is applied is reduced, and the circuit scale is reduced.

Furthermore, whether or not to convert the value of the coefficient is appropriately controlled using the neighboring coefficient, which produces a possibility that increase in processing delay is reduced and a possibility that increase in the amount of codes is reduced.

In addition, for example, the coefficient information flag is a flag indicating whether or not the value of the coefficient is greater than 1.

In this way, there is a possibility that decoding of the coefficient information flag indicating whether or not the value of the coefficient is greater than 1 is skipped according to the limitation on the total number of processes of context adaptive decoding regardless of application or non-application of inverse orthogonal transform. Thus, there is a possibility that increase in processing delay is reduced and increase in the amount of codes is reduced.

In addition, for example, the conversion process includes: replacing the value of the coefficient with 0 when the value of the coefficient is equal to the value determined using the neighboring coefficient; and increases the value of the coefficient by adding 1 to the value of the coefficient when the value of the coefficient is less than the value determined using the neighboring coefficient.

In this way, the value of the coefficient is appropriately converted according to neighboring coefficients, which produces a possibility that increase in the amount of codes is reduced.

Furthermore, for example, an encoding method according to an aspect of the present disclosure includes: limiting a total number of processes of context adaptive coding, and encodes a block in an image; and in the encoding of the block: in both a case where orthogonal transform is applied to the block, and a case where no orthogonal transform is applied to the block, encoding a coefficient information flag by context adaptive coding when the total number of processes is within an allowable range for the total number of processes, the coefficient information flag indicating an attribute of a coefficient included in the block, skipping encoding of the coefficient information flag when the total number of processes is not within the allowable range for the total number of processes, encoding remainder value information by Golomb-rice coding when the coefficient information flag is encoded, the remainder value information being for reconstructing a value of the coefficient using the coefficient information flag, when the encoding of the coefficient information flag is skipped in the case where orthogonal transform is applied to the block, performing a conversion process for converting the value of the coefficient using a value determined using a neighboring coefficient which is a coefficient that neighbors a position of the coefficient in the block, and encoding the value of the coefficient by Golomb-rice coding, and when the encoding of the coefficient information flag is skipped in the case where no orthogonal transform is applied to the block, skipping performing the conversion process, and encoding the value of the coefficient by Golomb-rice coding.

In this way, there is a possibility that encoding of the coefficient information flag is skipped regardless of application or non-application of orthogonal transform and the limitation on the total number of processes of context adaptive coding. Thus, there is a possibility that increase in processing delay is reduced and increase in the amount of codes is reduced. In addition, there is a possibility that the difference between the encoding scheme used for a block to which orthogonal transform is applied and the encoding scheme used for a block to which no orthogonal transform is applied is reduced, and the circuit scale is reduced.

Furthermore, whether or not to convert the value of the coefficient is appropriately controlled using the neighboring coefficient, which produces a possibility that increase in processing delay is reduced and a possibility that increase in the amount of codes is reduced.

Furthermore, for example, a decoding method according to an aspect of the present includes: limiting a total number of processes of context adaptive decoding, and decoding a block in an image; and in the decoding of the block: in both a case where inverse orthogonal transform is applied to the block, and a case where no inverse orthogonal transform is applied to the block, decoding a coefficient information flag by context adaptive decoding when the total number of processes is within an allowable range for the total number of processes, the coefficient information flag indicating an attribute of a coefficient included in the block, skipping decoding of the coefficient information flag when the total number of processes is not within the allowable range for the total number of processes, decoding remainder value information by Golomb-rice decoding when the coefficient information flag is decoded, the remainder value information being for reconstructing a value of the coefficient using the coefficient information flag, and deriving the value of the coefficient using the coefficient information flag and the remainder value information, when the decoding of the coefficient information flag is skipped in the case where inverse orthogonal transform is applied to the block, decoding the value of the coefficient by Golomb-rice decoding, performing a conversion process for converting the value of the coefficient using a value determined using a neighboring coefficient which is a coefficient that neighbors a position of the coefficient in the block, and deriving the value of the coefficient, and when the decoding of the coefficient information flag is skipped in the case where no inverse orthogonal transform is applied to the block, decoding the value of the coefficient by Golomb-rice decoding, skipping performing the conversion process, and deriving the value of the coefficient by Golomb-rice decoding.

In this way, there is a possibility that the coefficient information flag is decoded by context adaptive decoding regardless of application or non-application of inverse orthogonal transform and the limitation on the total number of processes of context adaptive decoding. Thus, there is a possibility that increase in processing delay is reduced and increase in the amount of codes is reduced. In addition, there is a possibility that the difference between the decoding scheme used for a block to which inverse orthogonal transform is applied and the decoding scheme used for a block to which no inverse orthogonal transform is applied is reduced, and the circuit scale is reduced.

Furthermore, whether or not to convert the value of the coefficient is appropriately controlled using the neighboring coefficient, which produces a possibility that increase in processing delay is reduced and a possibility that increase in the amount of codes is reduced.

In addition, for example, an encoder according to an aspect of the present disclosure includes a splitter, an intra predictor, an inter predictor, a prediction controller, a transformer, a quantizer, an entropy encoder, and a loop filter.

The splitter splits a current picture to be encoded included in the video into a plurality of blocks. The intra predictor performs intra prediction for generating a prediction image of a current block to be encoded in the current picture, using a reference image in the current picture. The inter predictor performs inter prediction for generating a prediction image of a current block to be encoded, using a reference image in a reference picture different from the current picture.

The prediction controller controls the intra prediction which is performed by the intra predictor and the inter prediction which is performed by the inter predictor. The transformer transforms prediction residual signals between the prediction image generated by either the intra predictor or the inter predictor and the image of the current block, to generate transform coefficient signals of the current block. The quantizer quantizes the transform coefficient signals. The entropy encoder encodes the quantized transform coefficient signals. The loop filter applies a filter to the current block.

Furthermore, for example, in operation, the entropy encoder limits a total number of processes of context adaptive coding, and encodes a block in an image; and when encoding the block, in both a case where orthogonal transform is applied to the block, and a case where no orthogonal transform is applied to the block, encodes a coefficient information flag by context adaptive coding when the total number of processes is within an allowable range for the total number of processes, the coefficient information flag indicating an attribute of a coefficient included in the block, skips encoding of the coefficient information flag when the total number of processes is not within the allowable range for the total number of processes, encodes remainder value information by Golomb-rice coding when the coefficient information flag is encoded, the remainder value information being for reconstructing a value of the coefficient using the coefficient information flag, when the encoding of the coefficient information flag is skipped in the case where orthogonal transform is applied to the block, performs a conversion process for converting the value of the coefficient using a value determined using a neighboring coefficient which is a coefficient that neighbors a position of the coefficient in the block, and encodes the value of the coefficient by Golomb-rice coding, and when the encoding of the coefficient information flag is skipped in the case where no orthogonal transform is applied to the block, skips performing the conversion process, and encodes the value of the coefficient by Golomb-rice coding.

Furthermore, for example, the decoder according to an aspect of the present disclosure is a decoder which decodes a video using a prediction image, and includes an entropy decoder, an inverse quantizer, an inverse transformer, an intra predictor, an inter predictor, a prediction controller, an adder (a reconstructor), and a loop filter.

The entropy decoder decodes quantized transform coefficient signals of a current block to be decoded in a current picture to be decoded included in the video. The inverse quantizer inverse-quantizes the quantized transform coefficient signals. The inverse transformer inverse-transforms the transform coefficient signals to obtain prediction residual signals of the current block.

The intra predictor performs intra prediction for generating a prediction image of a current block to be decoded, using a reference image in the current picture. The inter predictor performs inter prediction for generating a prediction image of a current block to be decoded, using a reference image in a reference picture different from the current picture. The prediction controller controls the intra prediction which is performed by the intra predictor and the inter prediction which is performed by the inter predictor.

The adder adds the prediction image generated by either the intra predictor or the inter predictor and the prediction residual signals, to reconstruct an image of the current block. The loop filter applies a filter to the current block.

Furthermore, for example, in operation, the entropy decoder limits a total number of processes of context adaptive decoding, and decodes a block in an image; and when decoding the block, in both a case where inverse orthogonal transform is applied to the block, and a case where no inverse orthogonal transform is applied to the block, decodes a coefficient information flag by context adaptive decoding when the total number of processes is within an allowable range for the total number of processes, the coefficient information flag indicating an attribute of a coefficient included in the block, skips decoding of the coefficient information flag when the total number of processes is not within the allowable range for the total number of processes, decodes remainder value information by Golomb-rice decoding when the coefficient information flag is decoded, the remainder value information being for reconstructing a value of the coefficient, and derives the value of the coefficient using the coefficient information flag and the remainder value information using the coefficient information flag, when the decoding of the coefficient information flag is skipped in the case where inverse orthogonal transform is applied to the block, decodes the value of the coefficient by Golomb-rice decoding, performs a conversion process for converting the value of the coefficient using a value determined using a neighboring coefficient which is a coefficient that neighbors a position of the coefficient in the block, and derives the value of the coefficient, and when the decoding of the coefficient information flag is skipped in the case where no inverse orthogonal transform is applied to the block, decodes the value of the coefficient by Golomb-rice decoding, skips performing the conversion process, and derives the value of the coefficient by Golomb-rice decoding.

Furthermore, these general or specific aspects may be implemented using a system, an apparatus, a method, an integrated circuit, a computer program, or a non-transitory computer-readable recording medium such as a CD-ROM, or any combination of systems, apparatuses, methods, integrated circuits, computer programs, or computer-readable recording media.

Hereinafter, embodiments will be described with reference to the drawings. Note that the embodiments described below each show a general or specific example. The numerical values, shapes, materials, components, the arrangement and connection of the components, steps, the relation and order of the steps, etc., indicated in the following embodiments are mere examples, and are not intended to limit the scope of the claims.

Embodiments of an encoder and a decoder will be described below. The embodiments are examples of an encoder and a decoder to which the processes and/or configurations presented in the description of aspects of the present disclosure are applicable. The processes and/or configurations can also be implemented in an encoder and a decoder different from those according to the embodiments. For example, regarding the processes and/or configurations as applied to the embodiments, any of the following may be implemented:

(1) Any of the components of the encoder or the decoder according to the embodiments presented in the description of aspects of the present disclosure may be substituted or combined with another component presented anywhere in the description of aspects of the present disclosure.

(2) In the encoder or the decoder according to the embodiments, discretionary changes may be made to functions or processes performed by one or more components of the encoder or the decoder, such as addition, substitution, removal, etc., of the functions or processes. For example, any function or process may be substituted or combined with another function or process presented anywhere in the description of aspects of the present disclosure.

(3) In methods implemented by the encoder or the decoder according to the embodiments, discretionary changes may be made such as addition, substitution, and removal of one or more of the processes included in the method. For example, any process in the method may be substituted or combined with another process presented anywhere in the description of aspects of the present disclosure.

(4) One or more components included in the encoder or the decoder according to embodiments may be combined with a component presented anywhere in the description of aspects of the present disclosure, may be combined with a component including one or more functions presented anywhere in the description of aspects of the present disclosure, and may be combined with a component that implements one or more processes implemented by a component presented in the description of aspects of the present disclosure.

(5) A component including one or more functions of the encoder or the decoder according to the embodiments, or a component that implements one or more processes of the encoder or the decoder according to the embodiments, may be combined or substituted with a component presented anywhere in the description of aspects of the present disclosure, with a component including one or more functions presented anywhere in the description of aspects of the present disclosure, or with a component that implements one or more processes presented anywhere in the description of aspects of the present disclosure.

(6) In methods implemented by the encoder or the decoder according to the embodiments, any of the processes included in the method may be substituted or combined with a process presented anywhere in the description of aspects of the present disclosure or with any corresponding or equivalent process.

(7) One or more processes included in methods implemented by the encoder or the decoder according to the embodiments may be combined with a process presented anywhere in the description of aspects of the present disclosure.

(8) The implementation of the processes and/or configurations presented in the description of aspects of the present disclosure is not limited to the encoder or the decoder according to the embodiments. For example, the processes and/or configurations may be implemented in a device used for a purpose different from the moving picture encoder or the moving picture decoder disclosed in the embodiments.

[Encoder]

First, an encoder according to an embodiment will be described. FIG. 1 is a block diagram illustrating a configuration of encoder 100 according to the embodiment. Encoder 100 is a video encoder which encodes a video in units of a block.

As illustrated in FIG. 1, encoder 100 is an apparatus which encodes an image in units of a block, and includes splitter 102, subtractor 104, transformer 106, quantizer 108, entropy encoder 110, inverse quantizer 112, inverse transformer 114, adder 116, block memory 118, loop filter 120, frame memory 122, intra predictor 124, inter predictor 126, and prediction controller 128.

Encoder 100 is implemented as, for example, a generic processor and memory. In this case, when a software program stored in the memory is executed by the processor, the processor functions as splitter 102, subtractor 104, transformer 106, quantizer 108, entropy encoder 110, inverse quantizer 112, inverse transformer 114, adder 116, loop filter 120, intra predictor 124, inter predictor 126, and prediction controller 128. Alternatively, encoder 100 may be implemented as one or more dedicated electronic circuits corresponding to splitter 102, subtractor 104, transformer 106, quantizer 108, entropy encoder 110, inverse quantizer 112, inverse transformer 114, adder 116, loop filter 120, intra predictor 124, inter predictor 126, and prediction controller 128.

Hereinafter, an overall flow of processes performed by encoder 100 is described, and then each of constituent elements included in encoder 100 will be described.

[Overall Flow of Encoding Process]

FIG. 2 is a flow chart indicating one example of an overall encoding process performed by encoder 100.

First, splitter 102 of encoder 100 splits each of pictures included in an input image which is a video into a plurality of blocks having a fixed size (e.g., 128×128 pixels) (Step Sal). Splitter 102 then selects a splitting pattern for the fixed-size block (also referred to as a block shape) (Step Sa_2). In other words, splitter 102 further splits the fixed-size block into a plurality of blocks which form the selected splitting pattern. Encoder 100 performs, for each of the plurality of blocks, Steps Sa_3 to Sa_9 for the block (that is a current block to be encoded).

In other words, a prediction processor which includes all or part of intra predictor 124, inter predictor 126, and prediction controller 128 generates a prediction signal (also referred to as a prediction block) of the current block to be encoded (also referred to as a current block) (Step Sa_3).

Next, subtractor 104 generates a difference between the current block and a prediction block as a prediction residual (also referred to as a difference block) (Step Sa_4).

Next, transformer 106 transforms the difference block and quantizer 108 quantizes the result, to generate a plurality of quantized coefficients (Step Sa_5). It is to be noted that the block having the plurality of quantized coefficients is also referred to as a coefficient block.

Next, entropy encoder 110 encodes (specifically, entropy encodes) the coefficient block and a prediction parameter related to generation of a prediction signal to generate an encoded signal (Step Sa_6). It is to be noted that the encoded signal is also referred to as an encoded bitstream, a compressed bitstream, or a stream.

Next, inverse quantizer 112 performs inverse quantization of the coefficient block and inverse transformer 114 performs inverse transform of the result, to restore a plurality of prediction residuals (that is, a difference block) (Step Sa_7).

Next, adder 116 adds the prediction block to the restored difference block to reconstruct the current block as a reconstructed image (also referred to as a reconstructed block or a decoded image block) (Step Sa_8). In this way, the reconstructed image is generated.

When the reconstructed image is generated, loop filter 120 performs filtering of the reconstructed image as necessary (Step Sa_9).

Encoder 100 then determines whether encoding of the entire picture has been finished (Step Sa_10). When determining that the encoding has not yet been finished (No in Step Sa_10), processes from Step Sa_2 are executed repeatedly.

Although encoder 100 selects one splitting pattern for a fixed-size block, and encodes each block according to the splitting pattern in the above-described example, it is to be noted that each block may be encoded according to a corresponding one of a plurality of splitting patterns. In this case, encoder 100 may evaluate a cost for each of the plurality of splitting patterns, and, for example, may select the encoded signal obtainable by encoding according to the splitting pattern which yields the smallest cost as an encoded signal which is output.

As illustrated, the processes in Steps Sa_1 to Sa_10 are performed sequentially by encoder 100. Alternatively, two or more of the processes may be performed in parallel, the processes may be reordered, etc.

[Splitter]

Splitter 102 splits each of pictures included in an input video into a plurality of blocks, and outputs each block to subtractor 104. For example, splitter 102 first splits a picture into blocks of a fixed size (for example, 128×128). Other fixed block sizes may be employed. The fixed-size block is also referred to as a coding tree unit (CTU). Splitter 102 then splits each fixed-size block into blocks of variable sizes (for example, 64×64 or smaller), based on recursive quadtree and/or binary tree block splitting. In other words, splitter 102 selects a splitting pattern. The variable-size block is also referred to as a coding unit (CU), a prediction unit (PU), or a transform unit (TU). It is to be noted that, in various kinds of processing examples, there is no need to differentiate between CU, PU, and TU; all or some of the blocks in a picture may be processed in units of a CU, a PU, or a TU.

FIG. 3 is a conceptual diagram illustrating one example of block splitting according to an embodiment. In FIG. 3, the solid lines represent block boundaries of blocks split by quadtree block splitting, and the dashed lines represent block boundaries of blocks split by binary tree block splitting.

Here, block 10 is a square block having 128×128 pixels (128×128 block). This 128×128 block 10 is first split into four square 64×64 blocks (quadtree block splitting).

The upper-left 64×64 block is further vertically split into two rectangular 32×64 blocks, and the left 32×64 block is further vertically split into two rectangular 16×64 blocks (binary tree block splitting). As a result, the upper-left 64×64 block is split into two 16×64 blocks 11 and 12 and one 32×64 block 13.

The upper-right 64×64 block is horizontally split into two rectangular 64×32 blocks 14 and 15 (binary tree block splitting).

The lower-left 64×64 block is first split into four square 32×32 blocks (quadtree block splitting). The upper-left block and the lower-right block among the four 32×32 blocks are further split. The upper-left 32×32 block is vertically split into two rectangle 16×32 blocks, and the right 16×32 block is further horizontally split into two 16×16 blocks (binary tree block splitting). The lower-right 32×32 block is horizontally split into two 32×16 blocks (binary tree block splitting). As a result, the lower-left 64×64 block is split into 16×32 block 16, two 16×16 blocks 17 and 18, two 32×32 blocks 19 and 20, and two 32×16 blocks 21 and 22.

The lower-right 64×64 block 23 is not split.

As described above, in FIG. 3, block 10 is split into thirteen variable-size blocks 11 through 23 based on recursive quadtree and binary tree block splitting. This type of splitting is also referred to as quadtree plus binary tree (QTBT) splitting.

It is to be noted that, in FIG. 3, one block is split into four or two blocks (quadtree or binary tree block splitting), but splitting is not limited to these examples. For example, one block may be split into three blocks (ternary block splitting). Splitting including such ternary block splitting is also referred to as multi-type tree (MBT) splitting.

[Picture Structure: Slice/Tile]

A picture may be configured in units of one or more slices or tiles in order to decode the picture in parallel. The picture configured in units of one or more slices or tiles may be configured by splitter 102.

Slices are basic encoding units included in a picture. A picture may include, for example, one or more slices. In addition, a slice includes one or more successive coding tree units (CTU).

FIG. 4A is a conceptual diagram illustrating one example of a slice configuration. For example, a picture includes 11×8 CTUs and is split into four slices (slices 1 to 4). Slice 1 includes sixteen CTUs, slice 2 includes twenty-one CTUs, slice 3 includes twenty-nine CTUs, and slice 4 includes twenty-two CTUs. Here, each CTU in the picture belongs to one of the slices. The shape of each slice is a shape obtainable by splitting the picture horizontally. A boundary of each slice does not need to be coincide with an image end, and may be coincide with any of the boundaries between CTUs in the image. The processing order of the CTUs in a slice (an encoding order or a decoding order) is, for example, a raster-scan order. A slice includes header information and encoded data. Features of the slice may be described in header information. The features include a CTU address of a top CTU in the slice, a slice type, etc.

A tile is a unit of a rectangular region included in a picture. Each of tiles may be assigned with a number referred to as TileId in raster-scan order.

FIG. 4B is a conceptual diagram indicating an example of a tile configuration. For example, a picture includes 11×8 CTUs and is split into four tiles of rectangular regions (tiles 1 to 4). When tiles are used, the processing order of CTUs are changed from the processing order in the case where no tile is used. When no tile is used, CTUs in a picture are processed in raster-scan order. When tiles are used, at least one CTU in each of the tiles is processed in raster-scan order. For example, as illustrated in FIG. 4B, the processing order of the CTUs included in tile 1 is the order which starts from the left-end of the first row of tile 1 toward the right-end of the first row of tile 1 and then starts from the left-end of the second row of tile 1 toward the right-end of the second row of tile 1.

It is to be noted that the one tile may include one or more slices, and one slice may include one or more tiles.

[Subtractor]

Subtractor 104 subtracts a prediction signal (prediction sample that is input from prediction controller 128 indicated below) from an original signal (original sample) in units of a block input from splitter 102 and split by splitter 102. In other words, subtractor 104 calculates prediction errors (also referred to as residuals) of a block to be encoded (hereinafter also referred to as a current block). Subtractor 104 then outputs the calculated prediction errors (residuals) to transformer 106.

The original signal is a signal which has been input into encoder 100 and represents an image of each picture included in a video (for example, a luma signal and two chroma signals). Hereinafter, a signal representing an image is also referred to as a sample.

[Transformer]

Transformer 106 transforms prediction errors in spatial domain into transform coefficients in frequency domain, and outputs the transform coefficients to quantizer 108. More specifically, transformer 106 applies, for example, a defined discrete cosine transform (DCT) or discrete sine transform (DST) to prediction errors in spatial domain. The defined DCT or DST may be predefined.

It is to be noted that transformer 106 may adaptively select a transform type from among a plurality of transform types, and transform prediction errors into transform coefficients by using a transform basis function corresponding to the selected transform type. This sort of transform is also referred to as explicit multiple core transform (EMT) or adaptive multiple transform (AMT).

The transform types include, for example, DCT-II, DCT-V, DCT-VIII, DST-I, and DST-VII. FIG. 5A is a chart indicating transform basis functions for the example transform types. In FIG. 5A, N indicates the number of input pixels. For example, selection of a transform type from among the plurality of transform types may depend on a prediction type (one of intra prediction and inter prediction), and may depend on an intra prediction mode.

Information indicating whether to apply such EMT or AMT (referred to as, for example, an EMT flag or an AMT flag) and information indicating the selected transform type is normally signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the bit sequence level, picture level, slice level, tile level, or CTU level).

In addition, transformer 106 may re-transform the transform coefficients (transform result). Such re-transform is also referred to as adaptive secondary transform (AST) or non-separable secondary transform (NSST). For example, transformer 106 performs re-transform in units of a sub-block (for example, 4×4 sub-block) included in a transform coefficient block corresponding to an intra prediction error. Information indicating whether to apply NSST and information related to a transform matrix for use in NSST are normally signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the sequence level, picture level, slice level, tile level, or CTU level).

Transformer 106 may employ a separable transform and a non-separable transform. A separable transform is a method in which a transform is performed a plurality of times by separately performing a transform for each of a number of directions according to the number of dimensions of inputs. A non-separable transform is a method of performing a collective transform in which two or more dimensions in multidimensional inputs are collectively regarded as a single dimension.

In one example of a non-separable transform, when an input is a 4×4 block, the 4×4 block is regarded as a single array including sixteen elements, and the transform applies a 16×16 transform matrix to the array.

In another example of a non-separable transform, a 4×4 input block is regarded as a single array including sixteen elements, and then a transform (hypercube givens transform) in which givens revolution is performed on the array a plurality of times may be performed.

In the transform in transformer 106, the types of bases to be transformed into the frequency domain according to regions in a CU can be switched. Examples include spatially varying transforms (SVT). In SVT, as illustrated in FIG. 5B, CUs are split into two equal regions horizontally or vertically, and only one of the regions is transformed into the frequency domain. A transform basis type can be set for each region. For example, DST7 and DST8 are used. In this example, only one of these two regions in the CU is transformed, and the other is not transformed. However, both of these two regions may be transformed. In addition, the splitting method is not limited to the splitting into two equal regions, and can be more flexible. For example, the CU may be split into four equal regions, or information indicating splitting may be encoded separately and be signaled in the same manner as the CU splitting. It is to be noted that SVT is also referred to as sub-block transform (SBT).

[Quantizer]

Quantizer 108 quantizes the transform coefficients output from transformer 106. More specifically, quantizer 108 scans, in a determined scanning order, the transform coefficients of the current block, and quantizes the scanned transform coefficients based on quantization parameters (QP) corresponding to the transform coefficients. Quantizer 108 then outputs the quantized transform coefficients (hereinafter also referred to as quantized coefficients) of the current block to entropy encoder 110 and inverse quantizer 112. The determined scanning order may be predetermined.

A determined scanning order is an order for quantizing/inverse quantizing transform coefficients. For example, a determined scanning order may be defined as ascending order of frequency (from low to high frequency) or descending order of frequency (from high to low frequency).

A quantization parameter (QP) is a parameter defining a quantization step (quantization width). For example, when the value of the quantization parameter increases, the quantization step also increases. In other words, when the value of the quantization parameter increases, the quantization error increases.

In addition, a quantization matrix may be used for quantization. For example, several kinds of quantization matrices may be used correspondingly to frequency transform sizes such as 4×4 and 8×8, prediction modes such as intra prediction and inter prediction, and pixel components such as luma and chroma pixel components. It is to be noted that quantization means digitalizing values sampled at determined intervals correspondingly to determined levels. In this technical field, quantization may be referred to using other expressions, such as rounding and scaling, and may employ rounding and scaling. The determined intervals and levels may be predetermined.

Methods using quantization matrices include a method using a quantization matrix which has been set directly at the encoder side and a method using a quantization matrix which has been set as a default (default matrix). At the encoder side, a quantization matrix suitable for features of an image can be set by directly setting a quantization matrix. This case, however, has a disadvantage of increasing a coding amount for encoding the quantization matrix.

There is a method for quantizing a high-frequency coefficient and a low-frequency coefficient without using a quantization matrix. It is to be noted that this method is equivalent to a method using a quantization matrix (flat matrix) whose coefficients have the same value.

The quantization matrix may be specified using, for example, a sequence parameter set (SPS) or a picture parameter set (PPS). The SPS includes a parameter which is used for a sequence, and the PPS includes a parameter which is used for a picture. Each of the SPS and the PPS may be simply referred to as a parameter set.

[Entropy Encoder]

Entropy encoder 110 generates an encoded signal (encoded bitstream) based on quantized coefficients which have been input from quantizer 108. More specifically, entropy encoder 110, for example, binarizes quantized coefficients, and arithmetically encodes the binary signal, and outputs a compressed bit stream or sequence.

[Inverse Quantizer]

Inverse quantizer 112 inverse quantizes quantized coefficients which have been input from quantizer 108. More specifically, inverse quantizer 112 inverse quantizes, in a determined scanning order, quantized coefficients of the current block. Inverse quantizer 112 then outputs the inverse quantized transform coefficients of the current block to inverse transformer 114. The determined scanning order may be predetermined.

[Inverse Transformer]

Inverse transformer 114 restores prediction errors (residuals) by inverse transforming transform coefficients which have been input from inverse quantizer 112. More specifically, inverse transformer 114 restores the prediction errors of the current block by applying an inverse transform corresponding to the transform applied by transformer 106 on the transform coefficients. Inverse transformer 114 then outputs the restored prediction errors to adder 116.

It is to be noted that since information is lost in quantization, the restored prediction errors do not match the prediction errors calculated by subtractor 104. In other words, the restored prediction errors normally include quantization errors.

[Adder]

Adder 116 reconstructs the current block by adding prediction errors which have been input from inverse transformer 114 and prediction samples which have been input from prediction controller 128. Adder 116 then outputs the reconstructed block to block memory 118 and loop filter 120. A reconstructed block is also referred to as a local decoded block.

[Block Memory]

Block memory 118 is, for example, storage for storing blocks in a picture to be encoded (hereinafter referred to as a current picture) which is referred to in intra prediction. More specifically, block memory 118 stores reconstructed blocks output from adder 116.

[Frame Memory]

Frame memory 122 is, for example, storage for storing reference pictures for use in inter prediction, and is also referred to as a frame buffer. More specifically, frame memory 122 stores reconstructed blocks filtered by loop filter 120.

[Loop Filter]

Loop filter 120 applies a loop filter to blocks reconstructed by adder 116, and outputs the filtered reconstructed blocks to frame memory 122. A loop filter is a filter used in an encoding loop (in-loop filter), and includes, for example, a deblocking filter (DF or DBF), a sample adaptive offset (SAO), and an adaptive loop filter (ALF).

In an ALF, a least square error filter for removing compression artifacts is applied. For example, one filter selected from among a plurality of filters based on the direction and activity of local gradients is applied for each of 2×2 sub-blocks in the current block.

More specifically, first, each sub-block (for example, each 2×2 sub-block) is categorized into one out of a plurality of classes (for example, fifteen or twenty-five classes). The classification of the sub-block is based on gradient directionality and activity. For example, classification index C (for example, C=5D+A) is derived based on gradient directionality D (for example, 0 to 2 or 0 to 4) and gradient activity A (for example, 0 to 4). Then, based on classification index C, each sub-block is categorized into one out of a plurality of classes.

For example, gradient directionality D is calculated by comparing gradients of a plurality of directions (for example, the horizontal, vertical, and two diagonal directions). Moreover, for example, gradient activity A is calculated by adding gradients of a plurality of directions and quantizing the result of addition.

The filter to be used for each sub-block is determined from among the plurality of filters based on the result of such categorization.

The filter shape to be used in an ALF is, for example, a circular symmetric filter shape. FIG. 6A through FIG. 6C illustrate examples of filter shapes used in ALFs. FIG. 6A illustrates a 5×5 diamond shape filter, FIG. 6B illustrates a 7×7 diamond shape filter, and FIG. 6C illustrates a 9×9 diamond shape filter. Information indicating the filter shape is normally signaled at the picture level. It is to be noted that the signaling of such information indicating the filter shape does not necessarily need to be performed at the picture level, and may be performed at another level (for example, at the sequence level, slice level, tile level, CTU level, or CU level).

The ON or OFF of the ALF is determined, for example, at the picture level or CU level. For example, the decision of whether to apply the ALF to luma may be made at the CU level, and the decision of whether to apply ALF to chroma may be made at the picture level. Information indicating ON or OFF of the ALF is normally signaled at the picture level or CU level. It is to be noted that the signaling of information indicating ON or OFF of the ALF does not necessarily need to be performed at the picture level or CU level, and may be performed at another level (for example, at the sequence level, slice level, tile level, or CTU level).

The coefficient set for the plurality of selectable filters (for example, fifteen or up to twenty-five filters) is normally signaled at the picture level. It is to be noted that the signaling of the coefficient set does not necessarily need to be performed at the picture level, and may be performed at another level (for example, at the sequence level, slice level, tile level, CTU level, CU level, or sub-block level).

[Loop Filter>Deblocking Filter]

In a deblocking filter, loop filter 120 performs a filter process on a block boundary in a reconstructed image so as to reduce distortion which occurs at the block boundary.

FIG. 7 is a block diagram illustrating one example of a specific configuration of loop filter 120 which functions as a deblocking filter.

Loop filter 120 includes: boundary determiner 1201; filter determiner 1203; filtering executor 1205; process determiner 1208; filter characteristic determiner 1207; and switches 1202, 1204, and 1206.

Boundary determiner 1201 determines whether a pixel to be deblock-filtered (that is, a current pixel) is present around a block boundary. Boundary determiner 1201 then outputs the determination result to switch 1202 and processing determiner 1208.

In the case where boundary determiner 1201 has determined that a current pixel is present around a block boundary, switch 1202 outputs an unfiltered image to switch 1204. In the opposite case where boundary determiner 1201 has determined that no current pixel is present around a block boundary, switch 1202 outputs an unfiltered image to switch 1206.

Filter determiner 1203 determines whether to perform deblocking filtering of the current pixel, based on the pixel value of at least one surrounding pixel located around the current pixel. Filter determiner 1203 then outputs the determination result to switch 1204 and processing determiner 1208.

In the case where filter determiner 1203 has determined to perform deblocking filtering of the current pixel, switch 1204 outputs the unfiltered image obtained through switch 1202 to filtering executor 1205. In the opposite case were filter determiner 1203 has determined not to perform deblocking filtering of the current pixel, switch 1204 outputs the unfiltered image obtained through switch 1202 to switch 1206.

When obtaining the unfiltered image through switches 1202 and 1204, filtering executor 1205 executes, for the current pixel, deblocking filtering with the filter characteristic determined by filter characteristic determiner 1207. Filtering executor 1205 then outputs the filtered pixel to switch 1206.

Under control by processing determiner 1208, switch 1206 selectively outputs a pixel which has not been deblock-filtered and a pixel which has been deblock-filtered by filtering executor 1205.

Processing determiner 1208 controls switch 1206 based on the results of determinations made by boundary determiner 1201 and filter determiner 1203. In other words, processing determiner 1208 causes switch 1206 to output the pixel which has been deblock-filtered when boundary determiner 1201 has determined that the current pixel is present around the block boundary and filter determiner 1203 has determined to perform deblocking filtering of the current pixel. In addition, other than the above case, processing determiner 1208 causes switch 1206 to output the pixel which has not been deblock-filtered. A filtered image is output from switch 1206 by repeating output of a pixel in this way.

FIG. 8 is a conceptual diagram indicating an example of a deblocking filter having a symmetrical filtering characteristic with respect to a block boundary.

In a deblocking filter process, one of two deblocking filters having different characteristics, that is, a strong filter and a weak filter is selected using pixel values and quantization parameters. In the case of the strong filter, pixels p0 to p2 and pixels q0 to q2 are present across a block boundary as illustrated in FIG. 8, the pixel values of the respective pixel q0 to q2 are changed to pixel values q′0 to q′2 by performing, for example, computations according to the expressions below.

q^(′)0 = (p 1 + 2 × p0 + 2 × q0 + 2 × q 1 + q2 + 4)/8 q^(′)1 = (p0 + q0 + q 1 + q 2 + 2)/4 q^(′)2 = (p0 + q0 + q 1 + 3 × q2 + 2 × q3 + 4)/8

It is to be noted that, in the above expressions, p0 to p2 and q0 to q2 are the pixel values of respective pixels p0 to p2 and pixels q0 to q2. In addition, q3 is the pixel value of neighboring pixel q3 located at the opposite side of pixel q2 with respect to the block boundary. In addition, in the right side of each of the expressions, coefficients which are multiplied with the respective pixel values of the pixels to be used for deblocking filtering are filter coefficients.

Furthermore, in the deblocking filtering, clipping may be performed so that the calculated pixel values are not set over a threshold value. In the clipping process, the pixel values calculated according to the above expressions are clipped to a value obtained according to “a computation pixel value±2×a threshold value” using the threshold value determined based on a quantization parameter. In this way, it is possible to prevent excessive smoothing.

FIG. 9 is a conceptual diagram for illustrating a block boundary on which a deblocking filter process is performed. FIG. 10 is a conceptual diagram indicating examples of Bs values.

The block boundary on which the deblocking filter process is performed is, for example, a boundary between prediction units (PU) having 8×8 pixel blocks as illustrated in FIG. 9 or a boundary between transform units (TU). The deblocking filter process may be performed in units of four rows or four columns. First, boundary strength (Bs) values are determined as indicated in FIG. 10 for block P and block Q illustrated in FIG. 9.

According to the Bs values in FIG. 10, whether to perform deblocking filter processes of block boundaries belonging to the same image using different strengths is determined. The deblocking filter process for a chroma signal is performed when a Bs value is 2. The deblocking filter process for a luma signal is performed when a Bs value is 1 or more and a determined condition is satisfied. The determined condition may be predetermined. It is to be noted that conditions for determining Bs values are not limited to those indicated in FIG. 10, and a Bs value may be determined based on another parameter.

[Prediction Processor (Intra Predictor, Inter Predictor, Prediction Controller)]

FIG. 11 is a flow chart illustrating one example of a process performed by the prediction processor of encoder 100. It is to be noted that the prediction processor includes all or part of the following constituent elements: intra predictor 124; inter predictor 126; and prediction controller 128.

The prediction processor generates a prediction image of a current block (Step Sb_1). This prediction image is also referred to as a prediction signal or a prediction block. It is to be noted that the prediction signal is, for example, an intra prediction signal or an inter prediction signal. Specifically, the prediction processor generates the prediction image of the current block using a reconstructed image which has been already obtained through generation of a prediction block, generation of a difference block, generation of a coefficient block, restoring of a difference block, and generation of a decoded image block.

The reconstructed image may be, for example, an image in a reference picture, or an image of an encoded block in a current picture which is the picture including the current block. The encoded block in the current picture is, for example, a neighboring block of the current block.

FIG. 12 is a flow chart illustrating another example of a process performed by the prediction processor of encoder 100.

The prediction processor generates a prediction image using a first method (Step Sc_1 a), generates a prediction image using a second method (Step Sc_1 b), and generates a prediction image using a third method (Step Sc_1 c). The first method, the second method, and the third method may be mutually different methods for generating a prediction image. Each of the first to third methods may be an inter prediction method, an intra prediction method, or another prediction method. The above-described reconstructed image may be used in these prediction methods.

Next, the prediction processor selects any one of a plurality of prediction methods generated in Steps Sc_1 a, Sc_1 b, and Sc_1 c (Step Sc_2). The selection of the prediction image, that is selection of a method or a mode for obtaining a final prediction image may be made by calculating a cost for each of the generated prediction images and based on the cost. Alternatively, the selection of the prediction image may be made based on a parameter which is used in an encoding process. Encoder 100 may transform information for identifying a selected prediction image, a method, or a mode into an encoded signal (also referred to as an encoded bitstream). The information may be, for example, a flag or the like. In this way, the decoder is capable of generating a prediction image according to the method or the mode selected based on the information in encoder 100. It is to be noted that, in the example illustrated in FIG. 12, the prediction processor selects any of the prediction images after the prediction images are generated using the respective methods. However, the prediction processor may select a method or a mode based on a parameter for use in the above-described encoding process before generating prediction images, and may generate a prediction image according to the method or mode selected.

For example, the first method and the second method may be intra prediction and inter prediction, respectively, and the prediction processor may select a final prediction image for a current block from prediction images generated according to the prediction methods.

FIG. 13 is a flow chart illustrating another example of a process performed by the prediction processor of encoder 100.

First, the prediction processor generates a prediction image using intra prediction (Step Sd_1 a), and generates a prediction image using inter prediction (Step Sd_1 b). It is to be noted that the prediction image generated by intra prediction is also referred to as an intra prediction image, and the prediction image generated by inter prediction is also referred to as an inter prediction image.

Next, the prediction processor evaluates each of the intra prediction image and the inter prediction image (Step Sd_2). A cost may be used in the evaluation. In other words, the prediction processor calculates cost C for each of the intra prediction image and the inter prediction image. Cost C may be calculated according to an expression of an R-D optimization model, for example, C=D+λ×R. In this expression, D indicates a coding distortion of a prediction image, and is represented as, for example, a sum of absolute differences between the pixel value of a current block and the pixel value of a prediction image. In addition, R indicates a predicted coding amount of a prediction image, specifically, the coding amount required to encode motion information for generating a prediction image, etc. In addition, a indicates, for example, a multiplier according to the method of Lagrange multiplier.

The prediction processor then selects the prediction image for which the smallest cost C has been calculated among the intra prediction image and the inter prediction image, as the final prediction image for the current block (Step Sd_3). In other words, the prediction method or the mode for generating the prediction image for the current block is selected.

[Intra Predictor]

Intra predictor 124 generates a prediction signal (intra prediction signal) by performing intra prediction (also referred to as intra frame prediction) of the current block by referring to a block or blocks in the current picture and stored in block memory 118. More specifically, intra predictor 124 generates an intra prediction signal by performing intra prediction by referring to samples (for example, luma and/or chroma values) of a block or blocks neighboring the current block, and then outputs the intra prediction signal to prediction controller 128.

For example, intra predictor 124 performs intra prediction by using one mode from among a plurality of intra prediction modes which have been defined. The intra prediction modes include one or more non-directional prediction modes and a plurality of directional prediction modes. The defined modes may be predefined.

The one or more non-directional prediction modes include, for example, the planar prediction mode and DC prediction mode defined in the H.265/high-efficiency video coding (HEVC) standard.

The plurality of directional prediction modes include, for example, the thirty-three directional prediction modes defined in the H.265/HEVC standard. It is to be noted that the plurality of directional prediction modes may further include thirty-two directional prediction modes in addition to the thirty-three directional prediction modes (for a total of sixty-five directional prediction modes). FIG. 14 is a conceptual diagram illustrating sixty-seven intra prediction modes in total that may be used in intra prediction (two non-directional prediction modes and sixty-five directional prediction modes). The solid arrows represent the thirty-three directions defined in the H.265/HEVC standard, and the dashed arrows represent the additional thirty-two directions (the two non-directional prediction modes are not illustrated in FIG. 14).

In various kinds of processing examples, a luma block may be referred to in intra prediction of a chroma block. In other words, a chroma component of the current block may be predicted based on a luma component of the current block. Such intra prediction is also referred to as cross-component linear model (CCLM) prediction. The intra prediction mode for a chroma block in which such a luma block is referred to (also referred to as, for example, a CCLM mode) may be added as one of the intra prediction modes for chroma blocks.

Intra predictor 124 may correct intra-predicted pixel values based on horizontal/vertical reference pixel gradients. Intra prediction accompanied by this sort of correcting is also referred to as position dependent intra prediction combination (PDPC). Information indicating whether to apply PDPC (referred to as, for example, a PDPC flag) is normally signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the sequence level, picture level, slice level, tile level, or CTU level).

[Inter Predictor]

Inter predictor 126 generates a prediction signal (inter prediction signal) by performing inter prediction (also referred to as inter frame prediction) of the current block by referring to a block or blocks in a reference picture, which is different from the current picture and is stored in frame memory 122. Inter prediction is performed in units of a current block or a current sub-block (for example, a 4×4 block) in the current block. For example, inter predictor 126 performs motion estimation in a reference picture for the current block or the current sub-block, and finds out a reference block or a sub-block which best matches the current block or the current sub-block. Inter predictor 126 then obtains motion information (for example, a motion vector) which compensates a motion or a change from the reference block or the sub-block to the current block or the sub-block. Inter predictor 126 generates an inter prediction signal of the current block or the sub-block by performing motion compensation (or motion prediction) based on the motion information. Inter predictor 126 outputs the generated inter prediction signal to prediction controller 128.

The motion information used in motion compensation may be signaled as inter prediction signals in various forms. For example, a motion vector may be signaled. As another example, the difference between a motion vector and a motion vector predictor may be signaled.

[Basic Flow of Inter Prediction]

FIG. 15 is a flow chart illustrating an example basic processing flow of inter prediction.

First, inter predictor 126 generates a prediction signal (Steps Se_1 to Se_3). Next, subtractor 104 generates the difference between a current block and a prediction image as a prediction residual (Step Se_4).

Here, in the generation of the prediction image, inter predictor 126 generates the prediction image through determination of a motion vector (MV) of the current block (Steps Se_1 and Se_2) and motion compensation (Step Se_3). Furthermore, in determination of an MV, inter predictor 126 determines the MV through selection of a motion vector candidate (MV candidate) (Step Se_1) and derivation of an MV (Step Se_2). The selection of the MV candidate is made by, for example, selecting at least one MV candidate from an MV candidate list. Alternatively, in derivation of an MV, inter predictor 126 may further select at least one MV candidate from the at least one MV candidate, and determine the selected at least one MV candidate as the MV for the current block. Alternatively, inter predictor 126 may determine the MV for the current block by performing estimation in a reference picture region specified by each of the selected at least one MV candidate. It is to be noted that the estimation in a reference picture region may be referred to as motion estimation.

In addition, although Steps Se_1 to Se_3 are performed by inter predictor 126 in the above-described example, a process that is for example Step Se_1, Step Se_2, or the like may be performed by another constituent element included in encoder 100.

[Motion Vector Derivation Flow]

FIG. 16 is a flow chart illustrating one example of derivation of motion vectors.

Inter predictor 126 derives an MV of a current block in a mode for encoding motion information (for example, an MV). In this case, for example, the motion information is encoded as a prediction parameter, and is signaled. In other words, the encoded motion information is included in an encoded signal (also referred to as an encoded bitstream).

Alternatively, inter predictor 126 derives an MV in a mode in which motion information is not encoded. In this case, no motion information is included in an encoded signal.

Here, MV derivation modes may include a normal inter mode, a merge mode, a FRUC mode, an affine mode, etc. which are described later. Modes in which motion information is encoded among the modes include the normal inter mode, the merge mode, the affine mode (specifically, an affine inter mode and an affine merge mode), etc. It is to be noted that motion information may include not only an MV but also motion vector predictor selection information which is described later. Modes in which no motion information is encoded include the FRUC mode, etc. Inter predictor 126 selects a mode for deriving an MV of the current block from the modes, and derives the MV of the current block using the selected mode.

FIG. 17 is a flow chart illustrating another example of derivation of motion vectors.

Inter predictor 126 derives an MV of a current block in a mode in which an MV difference is encoded. In this case, for example, the MV difference is encoded as a prediction parameter, and is signaled. In other words, the encoded MV difference is included in an encoded signal. The MV difference is the difference between the MV of the current block and the MV predictor.

Alternatively, inter predictor 126 derives an MV in a mode in which no MV difference is encoded. In this case, no encoded MV difference is included in an encoded signal.

Here, as described above, the MV derivation modes include the normal inter mode, the merge mode, the FRUC mode, the affine mode, etc. which are described later. Modes in which an MV difference is encoded among the modes include the normal inter mode, the affine mode (specifically, the affine inter mode), etc. Modes in which no MV difference is encoded include the FRUC mode, the merge mode, the affine mode (specifically, the affine merge mode), etc. Inter predictor 126 selects a mode for deriving an MV of the current block from the plurality of modes, and derives the MV of the current block using the selected mode.

[Motion Vector Derivation Flow]

FIG. 18 is a flow chart illustrating another example of derivation of motion vectors. The MV derivation modes which are inter prediction modes include a plurality of modes and are roughly divided into modes in which an MV difference is encoded and modes in which no motion vector difference is encoded. The modes in which no MV difference is encoded include the merge mode, the FRUC mode, the affine mode (specifically, the affine merge mode), etc. These modes are described in detail later. Simply, the merge mode is a mode for deriving an MV of a current block by selecting a motion vector from an encoded surrounding block, and the FRUC mode is a mode for deriving an MV of a current block by performing estimation between encoded regions. The affine mode is a mode for deriving, as an MV of a current block, a motion vector of each of a plurality of sub-blocks included in the current block, assuming affine transform.

More specifically, as illustrated when the inter prediction mode information indicates 0 (0 in Sf_1), inter predictor 126 derives a motion vector using the merge mode (Sf_2). When the inter prediction mode information indicates 1 (1 in Sf_1), inter predictor 126 derives a motion vector using the FRUC mode (Sf_3). When the inter prediction mode information indicates 2 (2 in Sf_1), inter predictor 126 derives a motion vector using the affine mode (specifically, the affine merge mode) (Sf_4). When the inter prediction mode information indicates 3 (3 in Sf_1), inter predictor 126 derives a motion vector using a mode in which an MV difference is encoded (for example, a normal inter mode (Sf_5).

[MV Derivation>Normal Inter Mode]

The normal inter mode is an inter prediction mode for deriving an MV of a current block based on a block similar to the image of the current block from a reference picture region specified by an MV candidate. In this normal inter mode, an MV difference is encoded.

FIG. 19 is a flow chart illustrating an example of inter prediction in normal inter mode.

First, inter predictor 126 obtains a plurality of MV candidates for a current block based on information such as MVs of a plurality of encoded blocks temporally or spatially surrounding the current block (Step Sg_1). In other words, inter predictor 126 generates an MV candidate list.

Next, inter predictor 126 extracts N (an integer of 2 or larger) MV candidates from the plurality of MV candidates obtained in Step Sg_1, as motion vector predictor candidates (also referred to as MV predictor candidates) according to a determined priority order (Step Sg_2). It is to be noted that the priority order may be determined in advance for each of the N MV candidates.

Next, inter predictor 126 selects one motion vector predictor candidate from the N motion vector predictor candidates, as the motion vector predictor (also referred to as an MV predictor) of the current block (Step Sg_3). At this time, inter predictor 126 encodes, in a stream, motion vector predictor selection information for identifying the selected motion vector predictor. It is to be noted that the stream is an encoded signal or an encoded bitstream as described above.

Next, inter predictor 126 derives an MV of a current block by referring to an encoded reference picture (Step Sg_4). At this time, inter predictor 126 further encodes, in the stream, the difference value between the derived MV and the motion vector predictor as an MV difference. It is to be noted that the encoded reference picture is a picture including a plurality of blocks which have been reconstructed after being encoded.

Lastly, inter predictor 126 generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the encoded reference picture (Step Sg_5). It is to be noted that the prediction image is an inter prediction signal as described above.

In addition, information indicating the inter prediction mode (normal inter mode in the above example) used to generate the prediction image is, for example, encoded as a prediction parameter.

It is to be noted that the MV candidate list may be also used as a list for use in another mode. In addition, the processes related to the MV candidate list may be applied to processes related to the list for use in another mode. The processes related to the MV candidate list include, for example, extraction or selection of an MV candidate from the MV candidate list, reordering of MV candidates, or deletion of an MV candidate.

[MV Derivation>Merge Mode]

The merge mode is an inter prediction mode for selecting an MV candidate from an MV candidate list as an MV of a current block, thereby deriving the MV.

FIG. 20 is a flow chart illustrating an example of inter prediction in merge mode.

First, inter predictor 126 obtains a plurality of MV candidates for a current block based on information such as MVs of a plurality of encoded blocks temporally or spatially surrounding the current block (Step Sh_1). In other words, inter predictor 126 generates an MV candidate list.

Next, inter predictor 126 selects one MV candidate from the plurality of MV candidates obtained in Step Sh_1, thereby deriving an MV of the current block (Step Sh_2). At this time, inter predictor 126 encodes, in a stream, MV selection information for identifying the selected MV candidate.

Lastly, inter predictor 126 generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the encoded reference picture (Step Sh_3).

In addition, information indicating the inter prediction mode (merge mode in the above example) used to generate the prediction image and included in the encoded signal is, for example, encoded as a prediction parameter.

FIG. 21 is a conceptual diagram for illustrating one example of a motion vector derivation process of a current picture in merge mode.

First, an MV candidate list in which MV predictor candidates are registered is generated. Examples of MV predictor candidates include: spatially neighboring MV predictors which are MVs of a plurality of encoded blocks located spatially surrounding a current block; temporally neighboring MV predictors which are MVs of surrounding blocks on which the position of a current block in an encoded reference picture is projected; combined MV predictors which are MVs generated by combining the MV value of a spatially neighboring MV predictor and the MV of a temporally neighboring MV predictor; and a zero MV predictor which is an MV having a zero value.

Next, one MV predictor is selected from a plurality of MV predictors registered in an MV predictor list, and the selected MV predictor is determined as the MV of a current block.

Furthermore, the variable length encoder describes and encodes, in a stream, merge_idx which is a signal indicating which MV predictor has been selected.

It is to be noted that the MV predictors registered in the MV predictor list described in FIG. 21 are examples. The number of MV predictors may be different from the number of MV predictors in the diagram, the MV predictor list may be configured in such a manner that some of the kinds of the MV predictors in the diagram may not be included, or that one or more MV predictors other than the kinds of MV predictors in the diagram are included.

A final MV may be determined by performing a decoder motion vector refinement process (DMVR) to be described later using the MV of the current block derived in merge mode.

It is to be noted that the MV predictor candidates are MV candidates described above, and the MV predictor list is the MV candidate list described above. It is to be noted that the MV candidate list may be referred to as a candidate list. In addition, merge_idx is MV selection information.

[MV Derivation>FRUC Mode]

Motion information may be derived at the decoder side without being signaled from the encoder side. It is to be noted that, as described above, the merge mode defined in the H.265/HEVC standard may be used. In addition, for example, motion information may be derived by performing motion estimation at the decoder side. In an embodiment, at the decoder side, motion estimation is performed without using any pixel value in a current block.

Here, a mode for performing motion estimation at the decoder side is described. The mode for performing motion estimation at the decoder side may be referred to as a pattern matched motion vector derivation (PMMVD) mode, or a frame rate up-conversion (FRUC) mode.

One example of a FRUC process in the form of a flow chart is illustrated in FIG. 22. First, a list of a plurality of candidates each having a motion vector (MV) predictor (that is, an MV candidate list that may be also used as a merge list) is generated by referring to a motion vector in an encoded block which spatially or temporally neighbors a current block (Step Si_1). Next, a best MV candidate is selected from the plurality of MV candidates registered in the MV candidate list (Step Si_2). For example, the evaluation values of the respective MV candidates included in the MV candidate list are calculated, and one MV candidate is selected based on the evaluation values. Based on the selected motion vector candidates, a motion vector for the current block is then derived (Step Si_4). More specifically, for example, the selected motion vector candidate (best MV candidate) is derived directly as the motion vector for the current block. In addition, for example, the motion vector for the current block may be derived using pattern matching in a surrounding region of a position in a reference picture where the position in the reference picture corresponds to the selected motion vector candidate. In other words, estimation using the pattern matching and the evaluation values may be performed in the surrounding region of the best MV candidate, and when there is an MV that yields a better evaluation value, the best MV candidate may be updated to the MV that yields the better evaluation value, and the updated MV may be determined as the final MV for the current block. A configuration in which no such a process for updating the best MV candidate to the MV having a better evaluation value is performed is also possible.

Lastly, inter predictor 126 generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the encoded reference picture (Step Si_5).

A similar process may be performed in units of a sub-block.

Evaluation values may be calculated according to various kinds of methods. For example, a comparison is made between a reconstructed image in a region in a reference picture corresponding to a motion vector and a reconstructed image in a determined region (the region may be, for example, a region in another reference picture or a region in a neighboring block of a current picture, as indicated below). The determined region may be predetermined.

The difference between the pixel values of the two reconstructed images may be used for an evaluation value of the motion vectors. It is to be noted that an evaluation value may be calculated using information other than the value of the difference.

Next, an example of pattern matching is described in detail. First, one MV candidate included in an MV candidate list (for example, a merge list) is selected as a start point of estimation by the pattern matching. For example, as the pattern matching, either a first pattern matching or a second pattern matching may be used. The first pattern matching and the second pattern matching are also referred to as bilateral matching and template matching, respectively.

[MV Derivation>FRUC>Bilateral Matching]

In the first pattern matching, pattern matching is performed between two blocks along a motion trajectory of a current block which are two blocks in different two reference pictures. Accordingly, in the first pattern matching, a region in another reference picture along the motion trajectory of the current block is used as a determined region for calculating the evaluation value of the above-described candidate. The determined region may be predetermined.

FIG. 23 is a conceptual diagram for illustrating one example of the first pattern matching (bilateral matching) between the two blocks in the two reference pictures along the motion trajectory. As illustrated in FIG. 23, in the first pattern matching, two motion vectors (MV0, MV1) are derived by estimating a pair which best matches among pairs in the two blocks in the two different reference pictures (Ref0, Ref1) which are the two blocks along the motion trajectory of the current block (Cur block). More specifically, a difference between the reconstructed image at a specified location in the first encoded reference picture (Ref0) specified by an MV candidate and the reconstructed image at a specified location in the second encoded reference picture (Ref1) specified by a symmetrical MV obtained by scaling the MV candidate at a display time interval is derived for the current block, and an evaluation value is calculated using the value of the obtained difference. It is possible to select, as the final MV, the MV candidate which yields the best evaluation value among the plurality of MV candidates, and which is likely to produce good results.

In the assumption of a continuous motion trajectory, the motion vectors (MV0, MV1) specifying the two reference blocks are proportional to temporal distances (TD0, TD1) between the current picture (Cur Pic) and the two reference pictures (Ref0, Ref1). For example, when the current picture is temporally located between the two reference pictures and the temporal distances from the current picture to the respective two reference pictures are equal to each other, mirror-symmetrical bi-directional motion vectors are derived in the first pattern matching.

[MV Derivation>FRUC>Template Matching]

In the second pattern matching (template matching), pattern matching is performed between a block in a reference picture and a template in the current picture (the template is a block neighboring the current block in the current picture (the neighboring block is, for example, an upper and/or left neighboring block(s))). Accordingly, in the second pattern matching, the block neighboring the current block in the current picture is used as the determined region for calculating the evaluation value of the above-described candidate.

FIG. 24 is a conceptual diagram for illustrating one example of pattern matching (template matching) between a template in a current picture and a block in a reference picture. As illustrated in FIG. 24, in the second pattern matching, the motion vector of the current block (Cur block) is derived by estimating, in the reference picture (Ref0), the block which best matches the block neighboring the current block in the current picture (Cur Pic). More specifically, it is possible that the difference between a reconstructed image in an encoded region which neighbors both left and above or either left or above and a reconstructed image which is in a corresponding region in the encoded reference picture (Ref0) and is specified by an MV candidate is derived, an evaluation value is calculated using the value of the obtained difference, and the MV candidate which yields the best evaluation value among a plurality of MV candidates is selected as the best MV candidate.

Such information indicating whether to apply the FRUC mode (referred to as, for example, a FRUC flag) may be signaled at the CU level. In addition, when the FRUC mode is applied (for example, when a FRUC flag is true), information indicating an applicable pattern matching method (either the first pattern matching or the second pattern matching) may be signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the sequence level, picture level, slice level, tile level, CTU level, or sub-block level).

[MV Derivation>Affine Mode]

Next, the affine mode for deriving a motion vector in units of a sub-block based on motion vectors of a plurality of neighboring blocks is described. This mode is also referred to as an affine motion compensation prediction mode.

FIG. 25A is a conceptual diagram for illustrating one example of deriving a motion vector of each sub-block based on motion vectors of a plurality of neighboring blocks. In FIG. 25A, the current block includes sixteen 4×4 sub-blocks. Here, motion vector V₀ at an upper-left corner control point in the current block is derived based on a motion vector of a neighboring block, and likewise, motion vector V₁ at an upper-right corner control point in the current block is derived based on a motion vector of a neighboring sub-block. Two motion vectors v₀ and v₁ may be projected according to an expression (1A) indicated below, and motion vectors (v_(x), v_(y)) for the respective sub-blocks in the current block may be derived.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 1} \right\rbrack & \; \\ \left\{ \begin{matrix} {v_{x} = {{\frac{\left( {v_{1x} - v_{0x}} \right)}{w}x} - {\frac{\left( {v_{1y} - v_{0y}} \right)}{w}y} + v_{0x}}} \\ {v_{y} = {{\frac{\left( {v_{1y} - v_{0y}} \right)}{w}x} - {\frac{\left( {v_{1x} - v_{0x}} \right)}{w}y} + v_{0y}}} \end{matrix} \right. & \left( {1A} \right) \end{matrix}$

Here, x and y indicate the horizontal position and the vertical position of the sub-block, respectively, and w indicates a determined weighting coefficient. The determined weighting coefficient may be predetermined.

Such information indicating the affine mode (for example, referred to as an affine flag) may be signaled at the CU level. It is to be noted that the signaling of the information indicating the affine mode does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the sequence level, picture level, slice level, tile level, CTU level, or sub-block level).

In addition, the affine mode may include several modes for different methods for deriving motion vectors at the upper-left and upper-right corner control points. For example, the affine mode include two modes which are the affine inter mode (also referred to as an affine normal inter mode) and the affine merge mode.

[MV Derivation>Affine Mode]

FIG. 25B is a conceptual diagram for illustrating one example of deriving a motion vector of each sub-block in affine mode in which three control points are used. In FIG. 25B, the current block includes sixteen 4×4 blocks. Here, motion vector V₀ at the upper-left corner control point for the current block is derived based on a motion vector of a neighboring block, and likewise, motion vector V₁ at the upper-right corner control point for the current block is derived based on a motion vector of a neighboring block, and motion vector V₂ at the lower-left corner control point for the current block is derived based on a motion vector of a neighboring block. Three motion vectors v₀, v₁, and v₂ may be projected according to an expression (1B) indicated below, and motion vectors (v_(x), v_(y)) for the respective sub-blocks in the current block may be derived.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 2} \right\rbrack & \; \\ \left\{ \begin{matrix} {v_{x} = {{\frac{\left( {v_{1x} - v_{0x}} \right)}{w}x} - {\frac{\left( {v_{2x} - v_{0x}} \right)}{h}y} + v_{0x}}} \\ {v_{y} = {{\frac{\left( {v_{1y} - v_{0y}} \right)}{w}x} - {\frac{\left( {v_{2y} - v_{0y}} \right)}{h}y} + v_{0y}}} \end{matrix} \right. & \left( {1B} \right) \end{matrix}$

Here, x and y indicate the horizontal position and the vertical position of the center of the sub-block, respectively, w indicates the width of the current block, and h indicates the height of the current block.

Affine modes in which different numbers of control points (for example, two and three control points) are used may be switched and signaled at the CU level. It is to be noted that information indicating the number of control points in affine mode used at the CU level may be signaled at another level (for example, the sequence level, picture level, slice level, tile level, CTU level, or sub-block level).

In addition, such an affine mode in which three control points are used may include different methods for deriving motion vectors at the upper-left, upper-right, and lower-left corner control points. For example, the affine modes include two modes which are the affine inter mode (also referred to as the affine normal inter mode) and the affine merge mode.

[MV Derivation>Affine Merge Mode]

FIG. 26A, FIG. 26B, and FIG. 26C are conceptual diagrams for illustrating the affine merge mode.

As illustrated in FIG. 26A, in the affine merge mode, for example, motion vector predictors at respective control points of a current block are calculated based on a plurality of motion vectors corresponding to blocks encoded according to the affine mode among encoded block A (left), block B (upper), block C (upper-right), block D (lower-left), and block E (upper-left) which neighbor the current block. More specifically, encoded block A (left), block B (upper), block C (upper-right), block D (lower-left), and block E (upper-left) are checked in the listed order, and the first effective block encoded according to the affine mode is identified. Motion vector predictors at the control points of the current block are calculated based on a plurality of motion vectors corresponding to the identified block.

For example, as illustrated in FIG. 26B, when block A which neighbors to the left of the current block has been encoded according to an affine mode in which two control points are used, motion vectors v₃ and v₄ projected at the upper-left corner position and the upper-right corner position of the encoded block including block A are derived. Motion vector predictor v₀ at the upper-left corner control point of the current block and motion vector predictor v₁ at the upper-right corner control point of the current block are then calculated from derived motion vectors v₃ and v₄.

For example, as illustrated in FIG. 26C, when block A which neighbors to the left of the current block has been encoded according to an affine mode in which three control points are used, motion vectors v₃, v₄, and v₅ projected at the upper-left corner position, the upper-right corner position, and the lower-left corner position of the encoded block including block A are derived. Motion vector predictor v₀ at the upper-left corner control point of the current block, motion vector predictor v₁ at the upper-right corner control point of the current block, and motion vector predictor v₂ at the lower-left corner control point of the current block are then calculated from derived motion vectors v₃, v₄, and v₅.

It is to be noted that this method for deriving motion vector predictors may be used to derive motion vector predictors of the respective control points of the current block in Step Sj_1 in FIG. 29 described later.

FIG. 27 is a flow chart illustrating one example of the affine merge mode.

In affine merge mode as illustrated, first, inter predictor 126 derives MV predictors of respective control points of a current block (Step Sk_1). The control points are an upper-left corner point of the current block and an upper-right corner point of the current block as illustrated in FIG. 25A, or an upper-left corner point of the current block, an upper-right corner point of the current block, and a lower-left corner point of the current block as illustrated in FIG. 25B.

In other words, as illustrated in FIG. 26A, inter predictor 126 checks encoded block A (left), block B (upper), block C (upper-right), block D (lower-left), and block E (upper-left) in the listed order, and identifies the first effective block encoded according to the affine mode.

When block A is identified and block A has two control points, as illustrated in FIG. 26B, inter predictor 126 calculates motion vector v₀ at the upper-left corner control point of the current block and motion vector v₁ at the upper-right corner control point of the current block from motion vectors v₃ and v₄ at the upper-left corner and the upper-right corner of the encoded block including block A. For example, inter predictor 126 calculates motion vector v₀ at the upper-left corner control point of the current block and motion vector v₁ at the upper-right corner control point of the current block by projecting motion vectors v₃ and v₄ at the upper-left corner and the upper-right corner of the encoded block onto the current block.

Alternatively, when block A is identified and block A has three control points, as illustrated in FIG. 26C, inter predictor 126 calculates motion vector v₀ at the upper-left corner control point of the current block, motion vector v₁ at the upper-right corner control point of the current block, and motion vector v₂ at the lower-left corner control point of the current block from motion vectors v₃, v₄, and v₅ at the upper-left corner, the upper-right corner, and the lower-left corner of the encoded block including block A. For example, inter predictor 126 calculates motion vector v₀ at the upper-left corner control point of the current block, motion vector v₁ at the upper-right corner control point of the current block, and motion vector v₂ at the lower-left corner control point of the current block by projecting motion vectors v₃, v₄, and v₅ at the upper-left corner, the upper-right corner, and the lower-left corner of the encoded block onto the current block.

Next, inter predictor 126 performs motion compensation of each of a plurality of sub-blocks included in the current block. In other words, inter predictor 126 calculates, for each of the plurality of sub-blocks, a motion vector of the sub-block as an affine MV, by using either (i) two motion vector predictors v₀ and v₁ and the expression (1A) described above or (ii) three motion vector predictors v₀, v₁, and v₂ and the expression (1B) described above (Step Sk_2). Inter predictor 126 then performs motion compensation of the sub-blocks using these affine MVs and encoded reference pictures (Step Sk_3). As a result, motion compensation of the current block is performed to generate a prediction image of the current block.

[MV Derivation>Affine Inter Mode]

FIG. 28A is a conceptual diagram for illustrating an affine inter mode in which two control points are used.

In the affine inter mode, as illustrated in FIG. 28A, a motion vector selected from motion vectors of encoded block A, block B, and block C which neighbor the current block is used as motion vector predictor v₀ at the upper-left corner control point of the current block. Likewise, a motion vector selected from motion vectors of encoded block D and block E which neighbor the current block is used as motion vector predictor v₁ at the upper-right corner control point of the current block.

FIG. 28B is a conceptual diagram for illustrating an affine inter mode in which three control points are used.

In the affine inter mode, as illustrated in FIG. 28B, a motion vector selected from motion vectors of encoded block A, block B, and block C which neighbor the current block is used as motion vector predictor v₀ at the upper-left corner control point of the current block. Likewise, a motion vector selected from motion vectors of encoded block D and block E which neighbor the current block is used as motion vector predictor v₁ at the upper-right corner control point of the current block. Furthermore, a motion vector selected from motion vectors of encoded block F and block G which neighbor the current block is used as motion vector predictor v₂ at the lower-left corner control point of the current block.

FIG. 29 is a flow chart illustrating one example of an affine inter mode.

In the affine inter mode as illustrated, first, inter predictor 126 derives MV predictors (v₀, v₁) or (v₀, v₁, v₂) of respective two or three control points of a current block (Step Sj_1). The control points are an upper-left corner point of the current block and an upper-right corner point of the current block as illustrated in FIG. 25A, or an upper-left corner point of the current block, an upper-right corner point of the current block, and a lower-left corner point of the current block as illustrated in FIG. 25B.

In other words, inter predictor 126 derives the motion vector predictors (v₀, v₁) or (v₀, v₁, v₂) of respective two or three control points of the current block by selecting motion vectors of any of the blocks among encoded blocks in the vicinity of the respective control points of the current block illustrated in either FIG. 28A or FIG. 28B. At this time, inter predictor 126 encodes, in a stream, motion vector predictor selection information for identifying the selected two motion vectors.

For example, inter predictor 126 may determine, using a cost evaluation or the like, the block from which a motion vector as a motion vector predictor at a control point is selected from among encoded blocks neighboring the current block, and may describe, in a bitstream, a flag indicating which motion vector predictor has been selected.

Next, inter predictor 126 performs motion estimation (Step Sj_3 and Sj_4) while updating a motion vector predictor selected or derived in Step Sj_1 (Step Sj_2). In other words, inter predictor 126 calculates, as an affine MV, a motion vector of each of sub-blocks which corresponds to an updated motion vector predictor, using either the expression (1A) or expression (1B) described above (Step Sj_3). Inter predictor 126 then performs motion compensation of the sub-blocks using these affine MVs and encoded reference pictures (Step Sj_4). As a result, for example, inter predictor 126 determines the motion vector predictor which yields the smallest cost as the motion vector at a control point in a motion estimation loop (Step Sj_5). At this time, inter predictor 126 further encodes, in the stream, the difference value between the determined MV and the motion vector predictor as an MV difference.

Lastly, inter predictor 126 generates a prediction image for the current block by performing motion compensation of the current block using the determined MV and the encoded reference picture (Step Sj_6).

[MV Derivation>Affine Inter Mode]

When affine modes in which different numbers of control points (for example, two and three control points) are used may be switched and signaled at the CU level, the number of control points in an encoded block and the number of control points in a current block may be different from each other. FIG. 30A and FIG. 30B are conceptual diagrams for illustrating methods for deriving motion vector predictors at control points when the number of control points in an encoded block and the number of control points in a current block are different from each other.

For example, as illustrated in FIG. 30A, when a current block has three control points at the upper-left corner, the upper-right corner, and the lower-left corner, and block A which neighbors to the left of the current block has been encoded according to an affine mode in which two control points are used, motion vectors v₃ and v₄ projected at the upper-left corner position and the upper-right corner position in the encoded block including block A are derived. Motion vector predictor v₀ at the upper-left corner control point of the current block and motion vector predictor v₁ at the upper-right corner control point of the current block are then calculated from derived motion vectors v₃ and v₄. Furthermore, motion vector predictor v₂ at the lower-left corner control point is calculated from derived motion vectors v₀ and v₁.

For example, as illustrated in FIG. 30B, when a current block has two control points at the upper-left corner and the upper-right corner, and block A which neighbors to the left of the current block has been encoded according to the affine mode in which three control points are used, motion vectors v₃, v₄, and v₅ projected at the upper-left corner position, the upper-right corner position, and the lower-left corner position in the encoded block including block A are derived. Motion vector predictor v₀ at the upper-left corner control point of the current block and motion vector predictor v₁ at the upper-right corner control point of the current block are then calculated from derived motion vectors v₃, v₄, and v₅.

It is to be noted that this method for deriving motion vector predictors may be used to derive motion vector predictors of the respective control points of the current block in Step Sj_1 in FIG. 29.

[MV Derivation>DMVR]

FIG. 31A is a flow chart illustrating a relationship between the merge mode and DMVR.

Inter predictor 126 derives a motion vector of a current block according to the merge mode (Step Sl_1). Next, inter predictor 126 determines whether to perform estimation of a motion vector, that is, motion estimation (Step Sl_2). Here, when determining not to perform motion estimation (No in Step Sl_2), inter predictor 126 determines the motion vector derived in Step Sl_1 as the final motion vector for the current block (Step Sl_4). In other words, in this case, the motion vector of the current block is determined according to the merge mode.

When determining to perform motion estimation in Step Sl_1 (Yes in Step Sl_2), inter predictor 126 derives the final motion vector for the current block by estimating a surrounding region of the reference picture specified by the motion vector derived in Step Sl_1 (Step Sl_3). In other words, in this case, the motion vector of the current block is determined according to the DMVR.

FIG. 31B is a conceptual diagram for illustrating one example of a DMVR process for determining an MV.

First, (for example, in merge mode) the best Motion Vector Predictor (MVP) which has been set to the current block is determined to be an MV candidate. A reference pixel is identified from a first reference picture (L0) which is an encoded picture in the L0 direction according to an MV candidate (L0). Likewise, a reference pixel is identified from a second reference picture (L1) which is an encoded picture in the L1 direction according to an MV candidate (L1). A template is generated by calculating an average of these reference pixels.

Next, each of the surrounding regions of MV candidates of the first reference picture (L0) and the second reference picture (L1) are estimated, and the MV which yields the smallest cost is determined to be the final MV. It is to be noted that the cost value may be calculated, for example, using a difference value between each of the pixel values in the template and a corresponding one of the pixel values in the estimation region, the values of MV candidates, etc.

It is to be noted that the processes, configurations, and operations described here typically are basically common between the encoder and a decoder to be described later.

Exactly the same example processes described here do not always need to be performed. Any process for enabling derivation of the final MV by estimation in surrounding regions of MV candidates may be used.

[Motion Compensation>BIO/OBMC]

Motion compensation involves a mode for generating a prediction image, and correcting the prediction image. The mode is, for example, BIO and OBMC to be described later.

FIG. 32 is a flow chart illustrating one example of generation of a prediction image.

Inter predictor 126 generates a prediction image (Step Sm_1), and corrects the prediction image, for example, according to any of the modes described above (Step Sm_2).

FIG. 33 is a flow chart illustrating another example of generation of a prediction image.

Inter predictor 126 determines a motion vector of a current block (Step Sn_1). Next, inter predictor 126 generates a prediction image (Step Sn_2), and determines whether to perform a correction process (Step Sn_3). Here, when determining to perform a correction process (Yes in Step Sn_3), inter predictor 126 generates the final prediction image by correcting the prediction image (Step Sn_4). When determining not to perform a correction process (No in Step Sn_3), inter predictor 126 outputs the prediction image as the final prediction image without correcting the prediction image (Step Sn_5).

In addition, motion compensation involves a mode for correcting a luminance of a prediction image when generating the prediction image. The mode is, for example, LIC to be described later.

FIG. 34 is a flow chart illustrating another example of generation of a prediction image.

Inter predictor 126 derives a motion vector of a current block (Step So_1). Next, inter predictor 126 determines whether to perform a luminance correction process (Step So_2). Here, when determining to perform a luminance correction process (Yes in Step So_2), inter predictor 126 generates the prediction image while performing a luminance correction process (Step So_3). In other words, the prediction image is generated using LIC. When determining not to perform a luminance correction process (No in Step So_2), inter predictor 126 generates a prediction image by performing normal motion compensation without performing a luminance correction process (Step So_4).

[Motion Compensation>OBMC]

It is to be noted that an inter prediction signal may be generated using motion information for a neighboring block in addition to motion information for the current block obtained from motion estimation. More specifically, the inter prediction signal may be generated in units of a sub-block in the current block by performing a weighted addition of a prediction signal based on motion information obtained from motion estimation (in the reference picture) and a prediction signal based on motion information for a neighboring block (in the current picture). Such inter prediction (motion compensation) is also referred to as overlapped block motion compensation (OBMC).

In OBMC mode, information indicating a sub-block size for OBMC (referred to as, for example, an OBMC block size) may be signaled at the sequence level. Moreover, information indicating whether to apply the OBMC mode (referred to as, for example, an OBMC flag) may be signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the sequence level and CU level, and may be performed at another level (for example, at the picture level, slice level, tile level, CTU level, or sub-block level).

Examples of the OBMC mode will be described in further detail. FIGS. 35 and 36 are a flow chart and a conceptual diagram for illustrating an outline of a prediction image correction process performed by an OBMC process.

First, as illustrated in FIG. 36, a prediction image (Pred) is obtained through normal motion compensation using a motion vector (MV) assigned to the processing target (current) block. In FIG. 36, the arrow “MV” points a reference picture, and indicates what the current block of the current picture refers to in order to obtain a prediction image.

Next, a prediction image (Pred_L) is obtained by applying a motion vector (MV_L) which has been already derived for the encoded block neighboring to the left of the current block to the current block (re-using the motion vector for the current block). The motion vector (MV_L) is indicated by an arrow “MV_L” indicating a reference picture from a current block. A first correction of a prediction image is performed by overlapping two prediction images Pred and Pred_L. This provides an effect of blending the boundary between neighboring blocks.

Likewise, a prediction image (Pred_U) is obtained by applying a motion vector (MV_U) which has been already derived for the encoded block neighboring above the current block to the current block (re-using the motion vector for the current block). The motion vector (MV_U) is indicated by an arrow “MV_U” indicating a reference picture from a current block. A second correction of a prediction image is performed by overlapping the prediction image Pred_U to the prediction images (for example, Pred and Pred_L) on which the first correction has been performed. This provides an effect of blending the boundary between neighboring blocks. The prediction image obtained by the second correction is the one in which the boundary between the neighboring blocks has been blended (smoothed), and thus is the final prediction image of the current block.

Although the above example is a two-path correction method using left and upper neighboring blocks, it is to be noted that the correction method may be three- or more-path correction method using also the right neighboring block and/or the lower neighboring block.

It is to be noted that the region in which such overlapping is performed may be only part of a region near a block boundary instead of the pixel region of the entire block.

It is to be noted that the prediction image correction process according to OBMC for obtaining one prediction image Pred from one reference picture by overlapping additional prediction image Pred_L and Pred_U have been described above. However, when a prediction image is corrected based on a plurality of reference images, a similar process may be applied to each of the plurality of reference pictures. In such a case, after corrected prediction images are obtained from the respective reference pictures by performing OBMC image correction based on the plurality of reference pictures, the obtained corrected prediction images are further overlapped to obtain the final prediction image.

It is to be noted that, in OBMC, the unit of a current block may be the unit of a prediction block or the unit of a sub-block obtained by further splitting the prediction block.

One example of a method for determining whether to apply an OBMC process is a method for using an obmc_flag which is a signal indicating whether to apply an OBMC process. As one specific example, an encoder determines whether the current block belongs to a region having complicated motion. The encoder sets the obmc_flag to a value of “1” when the block belongs to a region having complicated motion and applies an OBMC process when encoding, and sets the obmc_flag to a value of “0” when the block does not belong to a region having complicated motion and encodes the block without applying an OBMC process. The decoder switches between application and non-application of an OBMC process by decoding the obmc_flag written in the stream (for example, a compressed sequence) and decoding the block by switching between the application and non-application of the OBMC process in accordance with the flag value.

Inter predictor 126 generates one rectangular prediction image for a rectangular current block in the above example. However, inter predictor 126 may generate a plurality of prediction images each having a shape different from a rectangle for the rectangular current block, and may combine the plurality of prediction images to generate the final rectangular prediction image. The shape different from a rectangle may be, for example, a triangle.

FIG. 37 is a conceptual diagram for illustrating generation of two triangular prediction images.

Inter predictor 126 generates a triangular prediction image by performing motion compensation of a first partition having a triangular shape in a current block by using a first MV of the first partition, to generate a triangular prediction image. Likewise, inter predictor 126 generates a triangular prediction image by performing motion compensation of a second partition having a triangular shape in a current block by using a second MV of the second partition, to generate a triangular prediction image. Inter predictor 126 then generates a prediction image having the same rectangular shape as the rectangular shape of the current block by combining these prediction images.

It is to be noted that, although the first partition and the second partition are triangles in the example illustrated in FIG. 37, the first partition and the second partition may be trapezoids, or other shapes different from each other. Furthermore, although the current block includes two partitions in the example illustrated in FIG. 37, the current block may include three or more partitions.

In addition, the first partition and the second partition may overlap with each other. In other words, the first partition and the second partition may include the same pixel region. In this case, a prediction image for a current block may be generated using a prediction image in the first partition and a prediction image in the second partition.

In addition, although an example in which a prediction image is generated for each of two partitions using inter prediction, a prediction image may be generated for at least one partition using intra prediction.

[Motion Compensation>BIO]

Next, a method for deriving a motion vector is described. First, a mode for deriving a motion vector based on a model assuming uniform linear motion will be described. This mode is also referred to as a bi-directional optical flow (BIO) mode.

FIG. 38 is a conceptual diagram for illustrating a model assuming uniform linear motion. In FIG. 38, (vx, vy) indicates a velocity vector, and τ0 and ti indicate temporal distances between a current picture (Cur Pic) and two reference pictures (Ref0, Ref1). (MVx0, MVy0) indicate motion vectors corresponding to reference picture Ref0, and (MVx1, MVy1) indicate motion vectors corresponding to reference picture Ref1.

Here, under the assumption of uniform linear motion exhibited by velocity vectors (v_(x), v_(y)), (MVx₀, MVy₀) and (MVx₁, MVy₁) are represented as (v_(x)τ₀, v_(y)τ₀) and (−v_(x)τ₁, −v_(y)τ₁), respectively, and the following optical flow equation (2) may be employed.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 3} \right\rbrack & \; \\ \begin{matrix} {{{{\partial I^{(k)}}/{\partial t}} + {v_{x}{{\partial I^{(k)}}/{\partial x}}} + {v_{y}{{\partial I^{(k)}}/{\partial y}}}} = {0.(2)}} & \; \end{matrix} & (2) \end{matrix}$

Here, I(k) indicates a motion-compensated luma value of reference picture k (k=0, 1). This optical flow equation shows that the sum of (i) the time derivative of the luma value, (ii) the product of the horizontal velocity and the horizontal component of the spatial gradient of a reference image, and (iii) the product of the vertical velocity and the vertical component of the spatial gradient of a reference image is equal to zero. A motion vector of each block obtained from, for example, a merge list may be corrected in units of a pixel, based on a combination of the optical flow equation and Hermite interpolation.

It is to be noted that a motion vector may be derived on the decoder side using a method other than deriving a motion vector based on a model assuming uniform linear motion. For example, a motion vector may be derived in units of a sub-block based on motion vectors of neighboring blocks.

[Motion Compensation>LIC]

Next, an example of a mode in which a prediction image (prediction) is generated by using a local illumination compensation (LIC) process will be described.

FIG. 39 is a conceptual diagram for illustrating one example of a prediction image generation method using a luminance correction process performed by a LIC process.

First, an MV is derived from an encoded reference picture, and a reference image corresponding to the current block is obtained.

Next, information indicating how the luma value changed between the reference picture and the current picture is extracted for the current block. This extraction is performed based on the luma pixel values for the encoded left neighboring reference region (surrounding reference region) and the encoded upper neighboring reference region (surrounding reference region), and the luma pixel value at the corresponding position in the reference picture specified by the derived MV. A luminance correction parameter is calculated by using the information indicating how the luma value changed.

The prediction image for the current block is generated by performing a luminance correction process in which the luminance correction parameter is applied to the reference image in the reference picture specified by the MV.

It is to be noted that the shape of the surrounding reference region illustrated in FIG. 39 is just one example; the surrounding reference region may have a different shape.

Moreover, although the process in which a prediction image is generated from a single reference picture has been described here, cases in which a prediction image is generated from a plurality of reference pictures can be described in the same manner. The prediction image may be generated after performing a luminance correction process of the reference images obtained from the reference pictures in the same manner as described above.

One example of a method for determining whether to apply a LIC process is a method for using a lic_flag which is a signal indicating whether to apply the LIC process. As one specific example, the encoder determines whether the current block belongs to a region having a luminance change. The encoder sets the lic_flag to a value of “1” when the block belongs to a region having a luminance change and applies a LIC process when encoding, and sets the lic_flag to a value of “0” when the block does not belong to a region having a luminance change and encodes the current block without applying a LIC process. The decoder may decode the lic_flag written in the stream and decode the current block by switching between application and non-application of a LIC process in accordance with the flag value.

One example of a different method of determining whether to apply a LIC process is a determining method in accordance with whether a LIC process was applied to a surrounding block. In one specific example, when the merge mode is used on the current block, whether a LIC process was applied in the encoding of the surrounding encoded block selected upon deriving the MV in the merge mode process is determined. According to the result, encoding is performed by switching between application and non-application of a LIC process. It is to be noted that, also in this example, the same processes are applied in processes at the decoder side.

An embodiment of the luminance correction (LIC) process described with reference to FIG. 39 is described in detail below.

First, inter predictor 126 derives a motion vector for obtaining a reference image corresponding to a current block to be encoded from a reference picture which is an encoded picture.

Next, inter predictor 126 extracts information indicating how the luma value of the reference picture has been changed to the luma value of the current picture, using the luma pixel value of an encoded surrounding reference region which neighbors to the left of or above the current block and the luma value in the corresponding position in the reference picture specified by a motion vector, and calculates a luminance correction parameter. For example, it is assumed that the luma pixel value of a given pixel in the surrounding reference region in the current picture is p0, and that the luma pixel value of the pixel corresponding to the given pixel in the surrounding reference region in the reference picture is p1. Inter predictor 126 calculates coefficients A and B for optimizing A×p1+B=p0 as the luminance correction parameter for a plurality of pixels in the surrounding reference region.

Next, inter predictor 126 performs a luminance correction process using the luminance correction parameter for the reference image in the reference picture specified by the motion vector, to generate a prediction image for the current block. For example, it is assumed that the luma pixel value in the reference image is p2, and that the luminance-corrected luma pixel value of the prediction image is p3. Inter predictor 126 generates the prediction image after being subjected to the luminance correction process by calculating A×p2+B=p3 for each of the pixels in the reference image.

It is to be noted that the shape of the surrounding reference region illustrated in FIG. 39 is one example; a different shape other than the shape of the surrounding reference region may be used. In addition, part of the surrounding reference region illustrated in FIG. 39 may be used. For example, a region having a determined number of pixels extracted from each of an upper neighboring pixel and a left neighboring pixel may be used as a surrounding reference region. The determined number of pixels may be predetermined.

In addition, the surrounding reference region is not limited to a region which neighbors the current block, and may be a region which does not neighbor the current block. In the example illustrated in FIG. 39, the surrounding reference region in the reference picture is a region specified by a motion vector in a current picture, from a surrounding reference region in the current picture. However, a region specified by another motion vector is also possible. For example, the other motion vector may be a motion vector in a surrounding reference region in the current picture.

Although operations performed by encoder 100 have been described here, it is to be noted that decoder 200 typically performs similar operations.

It is to be noted that the LIC process may be applied not only to the luma but also to chroma. At this time, a correction parameter may be derived individually for each of Y, Cb, and Cr, or a common correction parameter may be used for any of Y, Cb, and Cr.

In addition, the LIC process may be applied in units of a sub-block. For example, a correction parameter may be derived using a surrounding reference region in a current sub-block and a surrounding reference region in a reference sub-block in a reference picture specified by an MV of the current sub-block.

[Prediction Controller]

Inter predictor 128 selects one of an intra prediction signal (a signal output from intra predictor 124) and an inter prediction signal (a signal output from inter predictor 126), and outputs the selected signal to subtractor 104 and adder 116 as a prediction signal.

As illustrated in FIG. 1, in various kinds of encoder examples, prediction controller 128 may output a prediction parameter which is input to entropy encoder 110. Entropy encoder 110 may generate an encoded bitstream (or a sequence), based on the prediction parameter which is input from prediction controller 128 and quantized coefficients which are input from quantizer 108. The prediction parameter may be used in a decoder. The decoder may receive and decode the encoded bitstream, and perform the same processes as the prediction processes performed by intra predictor 124, inter predictor 126, and prediction controller 128. The prediction parameter may include (i) a selection prediction signal (for example, a motion vector, a prediction type, or a prediction mode used by intra predictor 124 or inter predictor 126), or (ii) an optional index, a flag, or a value which is based on a prediction process performed in each of intra predictor 124, inter predictor 126, and prediction controller 128, or which indicates the prediction process.

[Mounting Example of Encoder]

FIG. 40 is a block diagram illustrating a mounting example of encoder 100. Encoder 100 includes processor a1 and memory a2. For example, the plurality of constituent elements of encoder 100 illustrated in FIG. 1 are mounted on processor a1 and memory a2 illustrated in FIG. 40.

Processor a1 is circuitry which performs information processing and is accessible to memory a2. For example, processor a1 is dedicated or general electronic circuitry which encodes a video. Processor a1 may be a processor such as a CPU. In addition, processor a1 may be an aggregate of a plurality of electronic circuits. In addition, for example, processor a1 may take the roles of two or more constituent elements out of the plurality of constituent elements of encoder 100 illustrated in FIG. 1, etc.

Memory a2 is dedicated or general memory for storing information that is used by processor a1 to encode a video. Memory a2 may be electronic circuitry, and may be connected to processor a1. In addition, memory a2 may be included in processor a1. In addition, memory a2 may be an aggregate of a plurality of electronic circuits. In addition, memory a2 may be a magnetic disc, an optical disc, or the like, or may be represented as a storage, a recording medium, or the like. In addition, memory a2 may be non-volatile memory, or volatile memory.

For example, memory a2 may store a video to be encoded or a bitstream corresponding to an encoded video. In addition, memory a2 may store a program for causing processor a1 to encode a video.

In addition, for example, memory a2 may take the roles of two or more constituent elements for storing information out of the plurality of constituent elements of encoder 100 illustrated in FIG. 1, etc. For example, memory a2 may take the roles of block memory 118 and frame memory 122 illustrated in FIG. 1. More specifically, memory a2 may store a reconstructed block, a reconstructed picture, etc.

It is to be noted that, in encoder 100, all of the plurality of constituent elements indicated in FIG. 1, etc. may not be implemented, and all the processes described above may not be performed. Part of the constituent elements indicated in FIG. 1, etc. may be included in another device, or part of the processes described above may be performed by another device.

[Decoder]

Next, a decoder capable of decoding an encoded signal (encoded bitstream) output, for example, from encoder 100 described above will be described. FIG. 41 is a block diagram illustrating a configuration of decoder 200 according to an embodiment. Decoder 200 is a video decoder which decodes a video in units of a block.

As illustrated in FIG. 41, decoder 200 includes entropy decoder 202, inverse quantizer 204, inverse transformer 206, adder 208, block memory 210, loop filter 212, frame memory 214, intra predictor 216, inter predictor 218, and prediction controller 220.

Decoder 200 is implemented as, for example, a generic processor and memory. In this case, when a software program stored in the memory is executed by the processor, the processor functions as entropy decoder 202, inverse quantizer 204, inverse transformer 206, adder 208, loop filter 212, intra predictor 216, inter predictor 218, and prediction controller 220. Alternatively, decoder 200 may be implemented as one or more dedicated electronic circuits corresponding to entropy decoder 202, inverse quantizer 204, inverse transformer 206, adder 208, loop filter 212, intra predictor 216, inter predictor 218, and prediction controller 220.

Hereinafter, an overall flow of processes performed by decoder 200 is described, and then each of constituent elements included in decoder 200 will be described.

[Overall Flow of Decoding Process]

FIG. 42 is a flow chart illustrating one example of an overall decoding process performed by decoder 200.

First, entropy decoder 202 of decoder 200 identifies a splitting pattern of a block having a fixed size (for example, 128×128 pixels) (Step Sp_1). This splitting pattern is a splitting pattern selected by encoder 100. Decoder 200 then performs processes of Step Sp_2 to Sp_6 for each of a plurality of blocks of the splitting pattern.

In other words, entropy decoder 202 decodes (specifically, entropy-decodes) encoded quantized coefficients and a prediction parameter of a current block to be decoded (also referred to as a current block) (Step Sp_2).

Next, inverse quantizer 204 performs inverse quantization of the plurality of quantized coefficients and inverse transformer 206 performs inverse transform of the result, to restore a plurality of prediction residuals (that is, a difference block) (Step Sp_3).

Next, the prediction processor including all or part of intra predictor 216, inter predictor 218, and prediction controller 220 generates a prediction signal (also referred to as a prediction block) of the current block (Step Sp_4).

Next, adder 208 adds the prediction block to the difference block to generate a reconstructed image (also referred to as a decoded image block) of the current block (Step Sp_5).

When the reconstructed image is generated, loop filter 212 performs filtering of the reconstructed image (Step Sp_6).

Decoder 200 then determines whether decoding of the entire picture has been finished (Step Sp_7). When determining that the decoding has not yet been finished (No in Step Sp_7), decoder 200 repeatedly executes the processes starting with Step Sp_1.

As illustrated, the processes of Steps Sp_1 to Sp_7 are performed sequentially by decoder 200. Alternatively, two or more of the processes may be performed in parallel, the processing order of the two or more of the processes may be modified, etc.

[Entropy Decoder]

Entropy decoder 202 entropy decodes an encoded bitstream. More specifically, for example, entropy decoder 202 arithmetic decodes an encoded bitstream into a binary signal. Entropy decoder 202 then debinarizes the binary signal. With this, entropy decoder 202 outputs quantized coefficients of each block to inverse quantizer 204. Entropy decoder 202 may output a prediction parameter included in an encoded bitstream (see FIG. 1) to intra predictor 216, inter predictor 218, and prediction controller 220. Intra predictor 216, inter predictor 218, and prediction controller 220 in an embodiment are capable of executing the same prediction processes as those performed by intra predictor 124, inter predictor 126, and prediction controller 128 at the encoder side.

[Inverse Quantizer]

Inverse quantizer 204 inverse quantizes quantized coefficients of a block to be decoded (hereinafter referred to as a current block) which are inputs from entropy decoder 202. More specifically, inverse quantizer 204 inverse quantizes quantized coefficients of the current block, based on quantization parameters corresponding to the quantized coefficients. Inverse quantizer 204 then outputs the inverse quantized transform coefficients of the current block to inverse transformer 206.

[Inverse Transformer]

Inverse transformer 206 restores prediction errors by inverse transforming the transform coefficients which are inputs from inverse quantizer 204.

For example, when information parsed from an encoded bitstream indicates that EMT or AMT is to be applied (for example, when an AMT flag is true), inverse transformer 206 inverse transforms the transform coefficients of the current block based on information indicating the parsed transform type.

Moreover, for example, when information parsed from an encoded bitstream indicates that NSST is to be applied, inverse transformer 206 applies a secondary inverse transform to the transform coefficients.

[Adder]

Adder 208 reconstructs the current block by adding prediction errors which are inputs from inverse transformer 206 and prediction samples which are inputs from prediction controller 220. Adder 208 then outputs the reconstructed block to block memory 210 and loop filter 212.

[Block Memory]

Block memory 210 is storage for storing blocks in a picture to be decoded (hereinafter referred to as a current picture) and to be referred to in intra prediction. More specifically, block memory 210 stores reconstructed blocks output from adder 208.

[Loop Filter]

Loop filter 212 applies a loop filter to blocks reconstructed by adder 208, and outputs the filtered reconstructed blocks to frame memory 214, display device, etc.

When information indicating ON or OFF of an ALF parsed from an encoded bitstream indicates that an ALF is ON, one filter from among a plurality of filters is selected based on direction and activity of local gradients, and the selected filter is applied to the reconstructed block.

[Frame Memory]

Frame memory 214 is, for example, storage for storing reference pictures for use in inter prediction, and is also referred to as a frame buffer. More specifically, frame memory 214 stores a reconstructed block filtered by loop filter 212.

[Prediction Processor (Intra Predictor, Inter Predictor, Prediction Controller)]

FIG. 43 is a flow chart illustrating one example of a process performed by a prediction processor of decoder 200. It is to be noted that the prediction processor includes all or part of the following constituent elements: intra predictor 216; inter predictor 218; and prediction controller 220.

The prediction processor generates a prediction image of a current block (Step Sq_1). This prediction image is also referred to as a prediction signal or a prediction block. It is to be noted that the prediction signal is, for example, an intra prediction signal or an inter prediction signal. Specifically, the prediction processor generates the prediction image of the current block using a reconstructed image which has been already obtained through generation of a prediction block, generation of a difference block, generation of a coefficient block, restoring of a difference block, and generation of a decoded image block.

The reconstructed image may be, for example, an image in a reference picture, or an image of a decoded block in a current picture which is the picture including the current block. The decoded block in the current picture is, for example, a neighboring block of the current block.

FIG. 44 is a flow chart illustrating another example of a process performed by the prediction processor of decoder 200.

The prediction processor determines either a method or a mode for generating a prediction image (Step Sr_1). For example, the method or mode may be determined based on, for example, a prediction parameter, etc.

When determining a first method as a mode for generating a prediction image, the prediction processor generates a prediction image according to the first method (Step Sr_2 a). When determining a second method as a mode for generating a prediction image, the prediction processor generates a prediction image according to the second method (Step Sr_2 b). When determining a third method as a mode for generating a prediction image, the prediction processor generates a prediction image according to the third method (Step Sr_2 c).

The first method, the second method, and the third method may be mutually different methods for generating a prediction image. Each of the first to third methods may be an inter prediction method, an intra prediction method, or another prediction method. The above-described reconstructed image may be used in these prediction methods.

[Intra Predictor]

Intra predictor 216 generates a prediction signal (intra prediction signal) by performing intra prediction by referring to a block or blocks in the current picture stored in block memory 210, based on the intra prediction mode parsed from the encoded bitstream. More specifically, intra predictor 216 generates an intra prediction signal by performing intra prediction by referring to samples (for example, luma and/or chroma values) of a block or blocks neighboring the current block, and then outputs the intra prediction signal to prediction controller 220.

It is to be noted that when an intra prediction mode in which a luma block is referred to in intra prediction of a chroma block is selected, intra predictor 216 may predict the chroma component of the current block based on the luma component of the current block.

Moreover, when information parsed from an encoded bitstream indicates that PDPC is to be applied, intra predictor 216 corrects intra-predicted pixel values based on horizontal/vertical reference pixel gradients.

[Inter Predictor]

Inter predictor 218 predicts the current block by referring to a reference picture stored in frame memory 214. Inter prediction is performed in units of a current block or a sub-block (for example, a 4×4 block) in the current block. For example, inter predictor 218 generates an inter prediction signal of the current block or the sub-block by performing motion compensation by using motion information (for example, a motion vector) parsed from an encoded bitstream (for example, a prediction parameter output from entropy decoder 202), and outputs the inter prediction signal to prediction controller 220.

It is to be noted that when the information parsed from the encoded bitstream indicates that the OBMC mode is to be applied, inter predictor 218 generates the inter prediction signal using motion information of a neighboring block in addition to motion information of the current block obtained from motion estimation.

Moreover, when the information parsed from the encoded bitstream indicates that the FRUC mode is to be applied, inter predictor 218 derives motion information by performing motion estimation in accordance with the pattern matching method (bilateral matching or template matching) parsed from the encoded bitstream. Inter predictor 218 then performs motion compensation (prediction) using the derived motion information.

Moreover, when the BIO mode is to be applied, inter predictor 218 derives a motion vector based on a model assuming uniform linear motion. Moreover, when the information parsed from the encoded bitstream indicates that the affine motion compensation prediction mode is to be applied, inter predictor 218 derives a motion vector of each sub-block based on motion vectors of neighboring blocks.

[MV Derivation>Normal Inter Mode]

When information parsed from an encoded bitstream indicates that the normal inter mode is to be applied, inter predictor 218 derives an MV based on the information parsed from the encoded bitstream and performs motion compensation (prediction) using the MV.

FIG. 45 is a flow chart illustrating an example of inter prediction in normal inter mode in decoder 200.

Inter predictor 218 of decoder 200 performs motion compensation for each block. Inter predictor 218 obtains a plurality of MV candidates for a current block based on information such as MVs of a plurality of decoded blocks temporally or spatially surrounding the current block (Step Ss_1). In other words, inter predictor 218 generates an MV candidate list.

Next, inter predictor 218 extracts N (an integer of 2 or larger) MV candidates from the plurality of MV candidates obtained in Step Ss_1, as motion vector predictor candidates (also referred to as MV predictor candidates) according to a determined priority order (Step Ss_2). It is to be noted that the priority order may be determined in advance for each of the N MV predictor candidates.

Next, inter predictor 218 decodes motion vector predictor selection information from an input stream (that is, an encoded bitstream), and selects, one MV predictor candidate from the N MV predictor candidates using the decoded motion vector predictor selection information, as a motion vector (also referred to as an MV predictor) of the current block (Step Ss_3).

Next, inter predictor 218 decodes an MV difference from the input stream, and derives an MV for a current block by adding a difference value which is the decoded MV difference and a selected motion vector predictor (Step Ss_4).

Lastly, inter predictor 218 generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the decoded reference picture (Step Ss_5).

[Prediction Controller]

Prediction controller 220 selects either the intra prediction signal or the inter prediction signal, and outputs the selected prediction signal to adder 208. As a whole, the configurations, functions, and processes of prediction controller 220, intra predictor 216, and inter predictor 218 at the decoder side may correspond to the configurations, functions, and processes of prediction controller 128, intra predictor 124, and inter predictor 126 at the encoder side.

[Mounting Example of Decoder]

FIG. 46 is a block diagram illustrating a mounting example of decoder 200. Decoder 200 includes processor b1 and memory b2. For example, the plurality of constituent elements of decoder 200 illustrated in FIG. 41 are mounted on processor b1 and memory b2 illustrated in FIG. 46.

Processor b1 is circuitry which performs information processing and is accessible to memory b2. For example, processor b1 is dedicated or general electronic circuitry which decodes a video (that is, an encoded bitstream). Processor b1 may be a processor such as a CPU. In addition, processor b1 may be an aggregate of a plurality of electronic circuits. In addition, for example, processor b1 may take the roles of two or more constituent elements out of the plurality of constituent elements of decoder 200 illustrated in FIG. 41, etc.

Memory b2 is dedicated or general memory for storing information that is used by processor b1 to decode an encoded bitstream. Memory b2 may be electronic circuitry, and may be connected to processor b1. In addition, memory b2 may be included in processor b1. In addition, memory b2 may be an aggregate of a plurality of electronic circuits. In addition, memory b2 may be a magnetic disc, an optical disc, or the like, or may be represented as a storage, a recording medium, or the like. In addition, memory b2 may be a non-volatile memory, or a volatile memory.

For example, memory b2 may store a video or a bitstream. In addition, memory b2 may store a program for causing processor b1 to decode an encoded bitstream.

In addition, for example, memory b2 may take the roles of two or more constituent elements for storing information out of the plurality of constituent elements of decoder 200 illustrated in FIG. 41, etc. Specifically, memory b2 may take the roles of block memory 210 and frame memory 214 illustrated in FIG. 41. More specifically, memory b2 may store a reconstructed block, a reconstructed picture, etc.

It is to be noted that, in decoder 200, all of the plurality of constituent elements illustrated in FIG. 41, etc. may not be implemented, and all the processes described above may not be performed. Part of the constituent elements indicated in FIG. 41, etc. may be included in another device, or part of the processes described above may be performed by another device.

Definitions of Terms

The respective terms may be defined as indicated below as examples.

A picture is an array of luma samples in monochrome format or an array of luma samples and two corresponding arrays of chroma samples in 4:2:0, 4:2:2, and 4:4:4 color format. A picture may be either a frame or a field.

A frame is the composition of a top field and a bottom field, where sample rows 0, 2, 4, . . . originate from the top field and sample rows 1, 3, 5, . . . originate from the bottom field.

A slice is an integer number of coding tree units contained in one independent slice segment and all subsequent dependent slice segments (if any) that precede the next independent slice segment (if any) within the same access unit.

A tile is a rectangular region of coding tree blocks within a particular tile column and a particular tile row in a picture. A tile may be a rectangular region of the frame that is intended to be able to be decoded and encoded independently, although loop-filtering across tile edges may still be applied.

A block is an M×N (M-column by N-row) array of samples, or an M×N array of transform coefficients. A block may be a square or rectangular region of pixels including one Luma and two Chroma matrices.

A coding tree unit (CTU) may be a coding tree block of luma samples of a picture that has three sample arrays, or two corresponding coding tree blocks of chroma samples. Alternatively, a CTU may be a coding tree block of samples of one of a monochrome picture and a picture that is coded using three separate color planes and syntax structures used to code the samples.

A super block may be a square block of 64×64 pixels that consists of either 1 or 2 mode info blocks or is recursively partitioned into four 32×32 blocks, which themselves can be further partitioned.

[Aspect 1 Relating to Coefficient Encoding]

FIG. 47 is a flow chart indicating a basic coefficient encoding method according to Aspect 1. Specifically, FIG. 47 indicates a coefficient encoding method in an area in which prediction residuals have been obtained in either intra encoding or inter encoding. The following description indicates an operation that is performed by encoder 100. Decoder 200 may perform an operation corresponding to the operation that is performed by encoder 100. For example, decoder 200 may perform inverse orthogonal transform and decoding corresponding to orthogonal transform and encoding that are performed by encoder 100.

FIG. 47 indicates last_sig_coeff, sublock_flag, thres, and CCB. Here, last_sig_coeff is a parameter indicating a coordinate position at which a coefficient that is not zero (a non-zero coefficient) appears firstly when scanning is performed in a block. Here, subblock_flag is a flag indicating whether or not a non-zero coefficient is present in a 4×4 subblock (that is also referred to as a 16 transform coefficient level). The subblock_flag is also referred to as coded_sub_block_flag, or a subblock flag.

Here, thres is a constant that is determined on a block-by-block basis. It is also excellent that thres is determined in advance. It is also excellent that thres is different depending on the size of a block, or may have the same value regardless of the size of a block. It is also excellent that thres takes a value that is different between when orthogonal transform is applied and when no orthogonal transform is applied. It is also excellent that thres is determined based on the coordinate position that is defined in the block by last_sig_coeff.

Here, CCB indicates a total number of bins encoded in a context mode in Context Adaptive Binary Arithmetic Coding (CABAC). In other words, CCB indicates a total number of encoding processes based on the context mode in CABAC. The context mode is also referred to as a regular mode. Here, the encoding based on the context mode in CABAC is referred to as CABAC coding or context adaptive coding. In addition, the encoding based on a bypass mode in CABAC is referred to as bypass coding. The processing by bypass coding is lighter than the processing by CABAC coding.

The CABAC coding is processing for transforming a bin string obtained by binarizing a coding-target signal into an encoded bitstream based on the occurrence probabilities of 0 and 1 for each bin. It is to be noted that the total number of all flags for use in residual coefficient encoding or the number of part of flags for use in residual coefficient encoding may be counted as CCB. The bypass coding is processing for encoding one of the bins in the bin string as one of the bits in the encoded bitstream, without using the variable occurrence probabilities of 0 and 1 for each bin (in other words, using fixed probabilities).

For example, encoder 100 determines the coefficient encoding scheme through comparison between a CCB value and a thres value.

Specifically, in FIG. 47, CCB is initialized to 0 (S101). Whether or not orthogonal transform is applied to a block is then determined (S102). When orthogonal transform is applied to the block (Yes in S102), encoder 100 encodes last_sig_coeff (S131). Encoder 100 then performs a loop process for each subblock (S141 to S148).

In the subblock-based loop process (S141 to S148), encoder 100 encodes subblock_flag regarding the sub-block. When sublock_flag is different from 0 (Yes in S146), encoder 100 encodes sixteen coefficients in the subblock using a first encoding scheme to be described later (S147).

When no orthogonal transform is applied to the block (No in S102), encoder 100 performs the loop process for each subblock (S121 to S128).

In the subblock-based loop process (S121 to S128), encoder 100 determines whether or not CCB is smaller than or equal to thres (S122). When CCB is smaller than or equal to thres (Yes in S122), encoder 100 encodes subblock_flag by CABAC coding (S123). Encoder 100 then counts up CCB (S124). Otherwise (No in S122), encoder 100 encodes subblock_flag by bypass coding (S125).

When sublock_flag is different from 0 (Yes in S126), encoder 100 encodes sixteen coefficients in the subblock using a second encoding scheme to be described later (S127).

A case where no orthogonal transform is applied to the block may be, for example, a case where orthogonal transform has been skipped. CCB is also used in the first encoding scheme and the second encoding scheme. CCB may be initialized on a subblock-by-subblock basis. In the case, thres may be not a fixed value for a block but a value that is variable for each subblock.

Although whether or not CCB counted up from 0 has reached thres is determined here, but it is to be noted that whether or not CCB counted down from thres (or a particular value) has reached 0 may be determined.

FIG. 48 is a flow chart indicating details of the first encoding scheme indicated in FIG. 47. In the first encoding scheme, a plurality of coefficients in a subblock are encoded. At that time, a first loop process (S151 to S156) is performed for each coefficient information flag of a corresponding one of coefficients in the subblock, and a second loop process (S161 to S165) is performed for each coefficient in the subblock.

In the first loop process (S151 to S156), one or more coefficient information flags each indicating one or more attributes of the coefficient are sequentially encoded. The one or more coefficient information flags may include sig_flag, gt1_flag, parity_flag, and gt3_flag. The one or more coefficient information flags are sequentially encoded by CABAC coding within a range in which CCB does not exceed thres, and CCB is counted up one-by-one each time of encoding. No coefficient information flag is encoded after CCB exceeds thres,

In other words, in the first loop process (S151 to S156), encoder 100 determines whether or not CCB is smaller than or equal to thres (S152). When CCB is smaller than or equal to thres (Yes in S152), encoder 100 encodes coefficient information flag by CABAC coding (S153). Encoder 100 then counts up CCB (S154). When CCB is not smaller than or equal to thres (No in S152), encoder 100 ends the first loop process (S151 to S156).

In the second loop process (S161 to S165), remainder that is a remainder value which is not represented by a coefficient information flag (that is a remainder value for reconstructing the value of the coefficient using the coefficient information flag) is encoded by Golomb-Rice coding for the coefficient for which the coefficient information flag has been encoded. A coefficient for which no coefficient information flag has been encoded is directly encoded by Golomb-Rice coding. It is to be noted that remainder may be encoded using another encoding scheme instead of using Golomb-Rice coding.

In other words, in the second loop process (S161 to S165), encoder 100 determines whether a coefficient information flag corresponding to a processing-target coefficient has been encoded (S162). When a coefficient information flag has been encoded (Yes in S162), encoder 100 encodes remainder by Golomb-Rice coding (S163). When no coefficient information flag has been encoded (No in S162), encoder 100 encodes the value of a coefficient by Golomb-Rice coding (S164).

The total number of loop processes is two here, but it is to be noted that the total number of loop processes may be different from two.

The above-described sig_flag is a flag indicating whether or not AbsLevel is non-zero. AbsLevel is a value of a coefficient, and specifically, the absolute value of the coefficient. Here, gt1_flag is a flag indicating whether or not AbsLevel is greater than 1. Here, parity_flag is a flag indicating a first bit of AbsLevel and indicating whether AbsLevel is an odd number or an even number. Here, gt3_flag is a flag indicating whether or not AbsLevel is greater than 3.

There is a case where gt1_flag and gt3_flag are respectively referred to as abs_gt1_flag and abs_gt3_flag. In addition, for example, the value obtained according to (Abslevel−4)/2 may be encoded as the above-described remainder.

Other one or more coefficient information flags different from the one or more coefficient information flags may be encoded. For example, part of the coefficient information flags does not always need to be encoded. A coefficient information flag included in the one or more coefficient information flags may be replaced with a coefficient information flag or a parameter having another meaning.

FIG. 49 is a flow chart indicating details of the second encoding scheme indicated in FIG. 47. In the second encoding scheme, a plurality of coefficients in a subblock are encoded. At that time, a first loop process (S171 to S176) is performed for each coefficient information flag of a corresponding one of coefficients in the subblock, and a second loop process (S181 to S185) is performed for each coefficient in the subblock.

In the first loop process (S171 to S176), one or more coefficient information flags each indicating one or more attributes of the coefficient are sequentially encoded. The one or more coefficient information flags may include sig_flag, sign_flag, gt1_flag, parity_flag, gt3_flag, gt5_flag, gt7_flag, and gt9_flag.

Here, sign_flag is a flag indicating a plus or minus sign of a coefficient. Here, gt5_flag is a flag indicating whether or not AbsLevel is greater than 5. Here, gt7_flag is a flag indicating whether or not AbsLevel is greater than 7. Here, gt9_flag is a flag indicating whether or not AbsLevel is greater than 9. There is a case where gt5_flag, gt7_flag, and gt9_flag are respectively referred to as abs_gt5_flag, abs_gt7_flag, and abs_gt9_flag. Alternatively, flags each indicating whether or not AbsLevel is greater than x (x is an integer of 1 or more) may be collectively represented as gtx_flag or abs_gtx_flag. AbsLevel is, for example, an absolute value at a transform coefficient level.

It is to be noted that other one or more coefficient information flags different from the one or more coefficient information flags may be encoded. For example, part of the coefficient information flags does not always need to be encoded. A coefficient information flag included in the one or more coefficient information flags may be replaced with a coefficient information flag or a parameter having another meaning.

The above-described one or more coefficient information flags are sequentially encoded by CABAC coding. Subsequently, CCB is counted up one-by-one each time of encoding. When CCB exceeds thres, the coefficient information flag is encoded by bypass coding.

In other words, in the first loop process (S171 to S176), encoder 100 determines whether or not CCB is smaller than or equal to thres (S172). When CCB is smaller than or equal to thres (Yes in S172), encoder 100 encodes a coefficient information flag by CABAC coding (S173). Encoder 100 then counts up CCB (S174). When CCB is not smaller than or equal to thres (No in S172), encoder 100 encodes the coefficient information flag by bypass coding (S175).

Syntaxes in the second loop process in FIG. 49 do not change before and after CCB exceeds thres. In other words, the same process is performed in the second loop process (S181 to S185) regardless of whether the coefficient information flag is encoded by CABAC coding or the coefficient information flag is encoded by bypass coding.

Specifically, in the second loop process (S181 to S185), encoder 100 encodes remainder that is a remainder value which is not represented by a coefficient information flag (that is a remainder value for reconstructing a value of the coefficient using the coefficient information flag) by Golomb-Rice coding (S183). It is to be noted that remainder may be encoded using another encoding scheme instead of using Golomb-Rice coding.

The total number of loop processes is two here, but it is to be noted that the total number of loop processes may be different from two.

As indicated in FIGS. 47, 48, and 49, in the basic operation according to this aspect, there is a flag that changes whether or not an encoding process of the flag is counted as the limited total number of CABAC coding processes, depending on whether or not orthogonal transform is applied. In addition, syntaxes in coefficient encoding are different between the case where orthogonal transform is applied and the case where no orthogonal transform is applied. For this reason, there is a possibility that different circuits need to be prepared for the respective cases. Accordingly, there is a possibility that the circuit configurations become complex.

[A First Example in Aspect 1 Relating to Coefficient Encoding]

FIG. 50 is a flow chart indicating a coefficient encoding method according to a first example in Aspect 1. In the example in FIG. 50, post-processing of last_sig_coeff (S132) and processing of subblock_flag (S142 to S145) are different from the processing in the example in FIG. 47.

In FIG. 47, when orthogonal transform is applied, CCB is counted up for sig_flag, parity_flag, and gtX_flag (X=1, 3). In the example in FIG. 50, CCB is counted up also for last_sig_coeff and subblock_flag. On the other hand, the processing flow in the case where no orthogonal transform is applied is the same as the processing flow in the example in FIG. 47.

In other words, in the example in FIG. 50, encoder 100 encodes last_sig_coeff (S131), and then adds the total number of CABAC coding processes in encoding of last_sig_coeff to CCB (S132).

In addition, encoder 100 determines whether or not CCB is smaller than or equal to thres before encoding of subblock_flag (S142). When CCB is smaller than or equal to thres (Yes in S142), encoder 100 encodes subblock_flag by CABAC coding (S143). Encoder 100 then adds 1 to CCB (S144). On the other hand, when CCB is not smaller than or equal to thres (No in S142), encoder 100 encodes subblock_flag by bypass coding (S145).

[Effects of the First Example in Aspect 1 Relating to Coefficient Encoding]

According to the example in FIG. 50, there is a case where it is possible to commonalize and unify the processing flow of encoding of subblock_flag between when orthogonal transform is performed and when no orthogonal transform is performed. Accordingly, there are a possibility that part of the circuits are shared between when orthogonal transform is performed and when no orthogonal transform is performed and a possibility that the circuit scale is reduced. As a result, there is a possibility that a plurality of processing flows which are divided depending on the application or non-application of orthogonal transform are the same except for the presence or absence of last_sig_coeff.

For example, even when the total number of CABAC coding processes is limited at a block level, in the example in FIG. 47, subblock_flag is to be inevitably encoded by CABAC coding after CCB reaches thres. On the other hand, in the case of FIG. 50, subblock_flag is not to be encoded by CABAC coding after CCB reaches thres. In this way, there is a possibility that the total number of CABAC coding processes is appropriately limited to thres.

It is to be noted that the total number of CABAC coding processes in last_sig_coeff does not always need to be included in CCB. In addition, thres may be determined based on the coordinate position that is defined in the block by last_sig_coeff.

Alternatively, encoder 100 may determine the value of subblock_flag to be always 1 after CCB exceeds thres. When it is defined that the value of subblock_flag is always 1 after CCB exceeds thres, encoder 100 does not always need to encode subblock_flag after CCB exceeds thres.

In addition, even when no orthogonal transform is applied, encoder 100 may determine the value of subblock_flag to be always 1 after CCB exceeds thres. Also in this case, when it is defined that the value of subblock_flag is always 1 after CCB exceeds thres, encoder 100 does not always need to encode subblock_flag after CCB exceeds thres.

[A Second Example in Aspect 1 Relating to Coefficient Encoding]

FIG. 51 is a flow chart indicating a coefficient encoding method according to a second example in Aspect 1. In the example in FIG. 51, the processing of subblock_flag (S123) is different from the processing in the example in FIG. 47.

In FIG. 47, when no orthogonal transform is applied, CCB is counted up for sig_flag, parity_flag, gtX_flag (X=1, 3, 5, 7, 9), and subblock_flag. In the example in FIG. 51, CCB is not counted up for subblock_flag. On the other hand, the processing flow in the case where orthogonal transform is applied is the same as the processing flow in the example in FIG. 47.

In other words, in the example in FIG. 51, encoder 100 always encodes subblock_flag by CABAC coding without counting up CCB regardless of whether or not CCB exceeds thres (S123).

[Effects of the Second Example in Aspect 1 Relating to Coefficient Encoding]

According to the example in FIG. 51, there is a case where it is possible to commonalize and unify the processing flow of encoding of subblock_flag between when orthogonal transform is performed and when no orthogonal transform is performed. Accordingly, there are a possibility that part of the circuits are shared between when orthogonal transform is performed and when no orthogonal transform is performed and a possibility that the circuit scale is reduced. As a result, there is a possibility that a plurality of processing flows which are divided depending on the application or non-application of orthogonal transform are the same except for the presence or absence of last_sig_coeff.

In addition, the processing is simplified in FIG. 51 compared with the processing in FIG. 50. Accordingly, there is possibility that the circuit scale is reduced. In addition, it is assumed that appearance frequency of 0 or 1 regarding subblock_flag tends to be deviated according to surrounding circumstances. Accordingly, it is assumed that the amount of reduction in the amount of codes is larger than the amount of increase in processing delay in the CABAC coding of subblock_flag. Accordingly, it is useful to perform the CABAC coding of subblock_flag without including the CABAC coding in the limited total number of CABAC coding processes.

It is to be noted that the total number of CABAC coding processes on last_sig_coeff does not always need to be included in CCB. In addition, thres may be determined based on the coordinate position that is defined in the block by last_sig_coeff.

[Aspect 2 Relating to Coefficient Encoding]

[A First Example in Aspect 2 Relating to Coefficient Encoding]

FIG. 52 is a flow chart indicating a coefficient encoding method according to a first example in Aspect 2. In the example of FIG. 52, even when no orthogonal transform is applied to a block, sixteen coefficients in a subblock is encoded by a first encoding scheme (S127 a). This is a difference from the example in FIG. 47.

Specifically, in the example in FIG. 52, encoder 100 encodes the sixteen coefficients in the subblock using not the second encoding scheme indicated in FIG. 49 but the first encoding scheme indicated in FIG. 48 when no orthogonal transform is applied to a block (S127 a). In other words, encoder 100 encodes the sixteen coefficients in the subblock using not the second encoding scheme indicated in FIG. 49 but the first encoding scheme indicated in FIG. 48 regardless of whether orthogonal transform is applied or no orthogonal transform is applied.

More specifically, encoder 100 skips encoding of coefficient information flag without using bypass coding when CCB exceeds thres in a first loop process according to the first encoding scheme indicated in FIG. 48 regardless of application or non-application of orthogonal transform. Encoder 100 then encodes a coefficient value by Golomb-Rice coding without using any coefficient information flag when no coefficient information flag corresponding to the processing-target coefficient has been encoded in a second loop process.

It is to be noted that the syntax for encoding the coefficient information flag in the first loop process in FIG. 48 may be different between when orthogonal transform is applied and when no orthogonal transform is applied. For example, part or all of the coefficient information flags may be different between one or more coefficient information flags in the case where orthogonal transform is applied and one or more coefficient information flags in the case where no orthogonal transform is applied.

[Effects of the First Example in Aspect 2 Relating to Coefficient Encoding]

According to the example in FIG. 52, there is a possibility that the syntaxes for use in encoding of the sixteen coefficients in the subblock are commonalized after CCB exceeds thres regardless of application or non-application of orthogonal transform even when the syntaxes for use in encoding of the coefficient information flags are different depending on whether or not orthogonal transform is applied. In this way, there is a possibility that part of the circuits is commonalized or the circuit scales is reduced.

Furthermore, after CCB exceeds thres, a coefficient is encoded without being divided to a coefficient information flag which is encoded by bypass coding and remainder value information which is encoded by Golomb-Rice coding. Accordingly, there are a possibility that increase in information amount is reduced and a possibility that increase in the amount of codes is reduced.

[A Second Example in Aspect 2 Relating to Coefficient Encoding]

FIG. 53 is a flow chart indicating a coefficient encoding method according to a second example in Aspect 2. In the example of FIG. 53, even when orthogonal transform is applied to a block, sixteen coefficients in a subblock is encoded by a second encoding scheme (S147 a). This is a difference from the example in FIG. 47.

In other words, in the example in FIG. 53, encoder 100 encodes the sixteen coefficients in the subblock using not a first encoding scheme indicated in FIG. 48 but the second encoding scheme indicated in FIG. 49 when orthogonal transform is applied to a block (S147 a). In other words, encoder 100 encodes the sixteen coefficients in the subblock using not the first encoding scheme indicated in FIG. 48 but the second encoding scheme indicated in FIG. 49 regardless of whether orthogonal transform is applied or no orthogonal transform is applied.

More specifically, encoder 100 encodes the coefficient information flags by bypass coding without skipping encoding when CCB exceeds thres in the first loop process, according to the second encoding scheme indicated in FIG. 49 regardless of application or non-application of orthogonal transform. Encoder 100 then encodes remainder that depends on the coefficient information flag in the second loop process by Golomb-Rice coding.

It is to be noted that the syntax for encoding the coefficient information flag in the first loop process in FIG. 49 may be different between when orthogonal transform is applied and when no orthogonal transform is applied. For example, part or all of the coefficient information flags may be different between one or more coefficient information flags in the case where orthogonal transform is applied and one or more coefficient information flags in the case where no orthogonal transform is applied.

[Effects of the Second Example in Aspect 2 Relating to Coefficient Encoding]

According to the example in FIG. 53, there is a possibility that the syntaxes for use in encoding of the sixteen coefficients in the subblock are commonalized after CCB exceeds thres regardless of application or non-application of orthogonal transform even when the syntaxes for use in encoding of the coefficient information flags are different depending on whether or not orthogonal transform is applied. In this way, there is a possibility that part of the circuits is commonalized or the circuit scales are reduced.

[Aspect 3 Relating to Coefficient Encoding]

FIG. 54 is a flow chart indicating a basic first encoding scheme according to Aspect 3. The syntaxes indicated in FIG. 54 correspond to examples of syntaxes for the first encoding scheme indicated in FIG. 47. Basically, the first encoding scheme is used when orthogonal transform is applied.

Here, the coefficient information flags and parameters are the same as the coefficient information flags and the parameters indicated in Aspect 1. It is to be noted that the coefficient information flags indicated here are examples, and other coefficient information flags may be encoded. For example, part of the coefficient information flags does not always need to be encoded. A coefficient information flag indicated here may be replaced with a coefficient information flag or a parameter having another meaning.

A first for loop in the example in FIG. 54 corresponds to the first loop process in the example in FIG. 48. When a value of CCB remains in the first for loop, in other words, when CCB does not exceed a threshold value, a coefficient information flag such as sig_flag is encoded by CABAC coding. When a value of CCB does not remain, no coefficient information flag is encoded. It is to be noted that the second example in Aspect 2 may be applied to this example. In other words, when a value of CCB does not remain, a coefficient information flag may be encoded by bypass coding.

A second for loop from above and a third for loop from above correspond to the second loop process in the example in FIG. 48. In the second for loop from above, a remainder value regarding a coefficient for which a coefficient information flag has been encoded is encoded by Golomb-Rice coding. In the third for loop from above, a coefficient that is a coefficient for which no coefficient information flag has been encoded is encoded by Golomb-Rice coding. It is to be noted that a remainder value may be always encoded by Golomb-Rice coding by the second example in Aspect 2 being applied to this example.

In a fourth for loop from above, sign_flag is encoded by bypass coding.

The syntaxes explained in this aspect may be applied to each of the examples in FIGS. 47, 48, 50, 51, and 52.

FIG. 55 is a syntax diagram indicating a basic second encoding scheme according to Aspect 3. The syntaxes indicated in FIG. 55 correspond to examples of syntaxes for the second encoding scheme indicated in FIG. 47. Basically, the second encoding scheme is used when no orthogonal transform is applied.

It is to be noted that the coefficient information flags indicated here are examples, and other coefficient information flags may be encoded. For example, part of the coefficient information flags does not always need to be encoded. A coefficient information flag indicated here may be replaced with a coefficient information flag or a parameter having another meaning.

Initial five for loops in the example in FIG. 55 corresponds to the first loop process in the example in FIG. 49. When a value of CCB remains in the initial five for loops, in other words, when CCB does not exceed a threshold value, coefficient information flags such as sig_flag are encoded by CABAC coding. In other words, when a value of CCB does not remain, coefficient information flags may be encoded by bypass coding. It is to be noted that the first example in Aspect 2 may be applied to this example. In other words, when a value of CCB does not remain, a coefficient information flag may not always be encoded.

A sixth for loop from above corresponds to the second loop process in the example in FIG. 49. In the sixth for loop from above, a remainder value is encoded by Golomb-Rice coding. It is to be noted that the first example in Aspect 2 may be applied to this example. Specifically, a remainder value regarding the coefficient for which a coefficient information flag has been encoded may be encoded by Golomb-Rice coding. Then, a coefficient that is a coefficient for which no coefficient information flag has been encoded may be encoded by Golomb-Rice coding.

The syntaxes explained in this aspect may be applied to each of the examples FIGS. 47, 49, 50, 51, and 53.

The total number of loop processes for encoding coefficient information flags is larger when no orthogonal transform is applied (FIG. 55) than when orthogonal transform is applied (FIG. 54). Thus, there is a case where the amount of processing by hardware inevitably increases when no orthogonal transform is applied more than the amount of processing when orthogonal transform is applied. Furthermore, since the syntaxes for coefficient encoding are different depending on whether or not orthogonal transform is applied, there is a possibility that different circuits need to be prepared for the respective cases. Accordingly, there is a possibility that the circuits become complex.

[A First Example in Aspect 3 Relating to Coefficient Encoding]

FIG. 56 is a flow chart indicating a second encoding scheme according to a first example in Aspect 3. The syntaxes indicated in FIG. 56 correspond to examples of syntaxes for the second encoding scheme indicated in FIG. 47. The syntaxes indicated in FIG. 54 may be used for the first encoding scheme in FIG. 47. It is to be noted that this example may be combined with another example in Aspect 3, or may be combined with another aspect.

A first for loop in the example in FIG. 56 corresponds to the first loop process in the example in FIG. 49. When a value of eight or more of CCB remains in the first for loop, in other words, when CCB with 8 added does not exceed a threshold value, coefficient information flags the total number of which is eight at most are encoded by CABAC coding according to the coefficients, and CCB is counted up eight times at most. When a value of eight or more of CCB does not remain, in other words, when CCB with 8 added exceeds the threshold value, eight coefficient information flags are encoded by bypass coding according to the coefficients.

In other words, it is collectively determined whether or not the eight coefficient information flags can be encoded by CABAC coding, before the eight coefficient information flags are encoded. When the eight coefficient information flags can be encoded by CABAC coding, the coefficient information flags the total number of which is eight at most are encoded by CABAC coding.

It is to be noted that the first example in Aspect 2 may be applied to this example. In other words, when CCB with 8 added does not exceed a threshold value, the eight coefficient information flags do not always need to be encoded. In other words, in this case, encoding of the eight coefficient information flags may be skipped without the eight coefficient information flags being encoded by bypass coding.

In addition, as in FIG. 56, encoding of one or more coefficient information flags among the eight coefficient information flags may be skipped according to the values of coefficients. For example, when sig_flag is 0, encoding of the remaining seven coefficient information flags may be skipped.

A second for loop from above the first line corresponds to the second loop process in the example in FIG. 49. In the second for loop from above, a remainder value is encoded by Golomb-Rice coding. It is to be noted that the first example in Aspect 2 may be applied to this example. Specifically, a remainder value regarding the coefficient for which eight coefficient information flags have been encoded is encoded by Golomb-Rice coding, and the coefficient that is the coefficient for which eight coefficient information flags have not been encoded is encoded by Golomb-Rice coding.

It is to be noted that the coefficient information flags indicated here are examples, and other coefficient information flags may be encoded. For example, part of the coefficient information flags does not always need to be encoded. A coefficient information flag indicated here may be replaced with a coefficient information flag or a parameter having another meaning.

In addition, the example in FIG. 55 and the example in FIG. 56 may be combined. For example, in the example in FIG. 55, it is also excellent that a collective determination is made as to whether or not the four coefficient information flags can be encoded by CABAC coding, before the four coefficient information flags such as sig_flag and sign_flag are encoded.

[Effects of the First Example in Aspect 3 Relating to Coefficient Encoding]

In the example in FIG. 56, all coefficient information flags which are encoded by CABAC coding are encoded in a single loop process. In other words, the total number of loop processes in the example in FIG. 56 is small compared with the one in the example in FIG. 55. Thus, there is a possibility that the processing amount is reduced.

The total number of loop processes for encoding coefficient information flags by CABAC coding in the example in FIG. 54 and the total number of loop processes for encoding coefficient information flags by CABAC coding in the example in FIG. 56 are equal to each other. Accordingly, there is a possibility that the circuitry in the combination of the example in FIG. 54 and the example in FIG. 56 needs to be less changed than the circuitry in the combination of the example in FIG. 54 and the example in FIG. 55.

Furthermore, since whether or not the coefficient information flags can be encoded by CABAC coding is collectively determined before the coefficient information flags are encoded, there is a possibility that the processing is simplified and the processing delay is reduced.

It is also excellent that a collective determination is made as to whether or not the coefficient information flags can be encoded by CABAC coding before the coefficient information flags are encoded in both the case where orthogonal transform is applied and the case where no orthogonal transform is applied. In this way, there is a possibility that the difference between the encoding scheme used for a block to which orthogonal transform is applied and the encoding scheme used for a block to which no orthogonal transform is applied is reduced, and the circuit scale is reduced.

In addition, in the example in FIG. 56, sig_flag to abs_gt9_flag are included in a single loop, encoding schemes are not limited to the encoding scheme. It is also excellent that a plurality of loops (for example two loops) are used, and that a collective determination is made as to whether or not the coefficient information flags can be encoded by CABAC coding for each of the loops. The processing increases more than the processing in the single loop, a processing reduction effect similar to the processing reduction effect in the example of FIG. 55 is obtained.

[A Second Example in Aspect 3 Relating to Coefficient Encoding]

FIG. 57 is a flow chart indicating a second encoding scheme according to a second example in Aspect 3. The syntaxes indicated in FIG. 57 correspond to examples of syntaxes for the second encoding scheme indicated in FIG. 47. The syntaxes indicated in FIG. 54 may be used for the first encoding scheme in FIG. 47. It is to be noted that this example may be combined with another example in Aspect 3, or may be combined with another aspect.

A first for loop in the example in FIG. 57 corresponds to the first loop process in the example in FIG. 49. When a value of seven or more of CCB remains in the first for loop, in other words, when CCB with 7 added does not exceed a threshold value, coefficient information flags the total number of which is seven at most are encoded by CABAC coding according to the coefficients, and CCB is counted up seven times at most. When a value of seven or more of CCB does not remain, in other words, when CCB with 7 added exceeds the threshold value, seven coefficient information flags are encoded by bypass coding according to the coefficients.

In other words, it is collectively determined whether or not the seven coefficient information flags can be encoded by CABAC coding, before the seven coefficient information flags are encoded. When the seven coefficient information flags can be encoded by CABAC coding, the coefficient information flags the total number of which is seven at most are encoded by CABAC coding.

It is to be noted that the first example in Aspect 2 may be applied to this example. In other words, when CCB with 7 added does not exceed the threshold value, the seven coefficient information flags do not always need to be encoded. In other words, in this case, encoding of the seven coefficient information flags may be skipped without the seven coefficient information flags being encoded by bypass coding.

In addition, as in FIG. 57, encoding of one or more coefficient information flags among the seven coefficient information flags may be skipped according to the values of coefficients. For example, when sig_flag is 0, encoding of the remaining six coefficient information flags may be skipped.

A second for loop from above corresponds to the second loop process in the example in FIG. 49. In the second for loop from above, a remainder value is encoded by Golomb-Rice coding. It is to be noted that the first example in Aspect 2 may be applied to this example. Specifically, a remainder value regarding the coefficient for which seven coefficient information flags have been encoded is encoded by Golomb-Rice coding, and the coefficient that is the coefficient for which seven coefficient information flags have not been encoded is encoded by Golomb-Rice coding.

When a value of CCB remains in the third for loop from above, in other words, when CCB does not exceed a threshold value, sign_flag is encoded by CABAC coding, and CCB is counted up. When a value of CCB does not remain, sign_flag is encoded by bypass coding. It is to be noted that sign_flag may be always encoded by bypass coding, as in the example in FIG. 54.

It is to be noted that the coefficient information flags indicated here are examples, and other coefficient information flags may be encoded. For example, part of the coefficient information flags does not always need to be encoded. A coefficient information flag indicated here may be replaced with a coefficient information flag or a parameter having another meaning.

In addition, the example in FIG. 55 and the example in FIG. 57 may be combined. For example, in the example in FIG. 55, it is also excellent that a collective determination is made as to whether or not the four coefficient information flags can be encoded by CABAC coding, before the four coefficient information flags such as sig_flag and sign_flag are encoded.

[Effects of the Second Example in Aspect 3 Relating to Coefficient Encoding]

As in the example in FIG. 56, in the example in FIG. 57, a plurality of coefficient information flags each is for indicating the magnitude of a coefficient compared with a threshold value (specifically, abs_gt3_flag and abs_gt5_flag, etc.) are encoded in a single loop process. Thus, the total number of loop processes in the example in FIG. 57 is small compared with the one in the example in FIG. 55. For this reason, there is a possibility that the processing amount is reduced.

Compared with the example in FIG. 56, in the example in FIG. 57, the total number of loop processes for encoding the coefficient information flags inevitably increases. However, the example in FIG. 57 is partly similar to the example in FIG. 54, compared with the example in FIG. 56. For example, sign_flag is encoded finally. Accordingly, there is a possibility that the circuitry in the combination of the example in FIG. 54 and the example in FIG. 57 needs to be less changed than the circuitry in the combination of the example in FIG. 54 and the example in FIG. 56.

Furthermore, since whether or not the coefficient information flags can be encoded by CABAC coding is collectively determined before the coefficient information flags are encoded, there is a possibility that the processing is simplified and the processing delay is reduced.

It is also excellent that a collective determination is made as to whether or not the coefficient information flags can be encoded by CABAC before the coefficient information flags are encoded in both the case where orthogonal transform is applied and the case where no orthogonal transform is applied. In addition, there is a possibility that the difference between the encoding scheme used for a block to which orthogonal transform is applied and the encoding scheme used for a block to which no orthogonal transform is applied is reduced, and the circuit scale is further reduced.

In addition, in the example in FIG. 57, sig_flag to abs_gt9_flag are included in a single loop, encoding schemes are not limited to the encoding scheme. It is also excellent that a plurality of loops (for example two loops) are used, and that a collective determination is made as to whether or not the coefficient information flags can be encoded by CABAC coding for each of the loops. The processing increases more than the processing in the single loop, a processing reduction effect similar to the processing reduction effect in the example of FIG. 55 is obtained.

[Aspect 4 Relating to Coefficient Encoding]

FIG. 58 is a diagram indicating basic correspondences between coefficient information flags and context numbers (indices) according to Aspect 4. Specifically, FIG. 58 illustrates an example of a method of determining a context number for encoding, by CABAC coding, a coefficient information flag to be encoded when no orthogonal transform is applied. A context number indicates an appearance probability of a value of 0 or 1. Encoder 100 performs arithmetic encoding of a coefficient information flag based on this appearance probability.

For example, when there is a high possibility that a current coefficient information flag to be encoded is 0, the amount of codes may be reduced by encoding the coefficient information flag by CABAC coding, based on the context number indicating the high appearance probability for the value of 0. In other words, the amount of codes may be reduced by performing arithmetic coding of the coefficient information flag based on the appropriate context number indicating the appropriate appearance probability.

FIG. 59 is a conceptual diagram indicating basic neighboring (surrounding) coefficients according to Aspect 4. In FIG. 59, x denotes a current coefficient to be encoded.

Coefficient scanning is performed diagonally starting with the 4×4 subblock located at the upper-left position illustrated in FIG. 59. Specifically, in a coordinate system in which the coordinates of the upper-left position, the coordinates of the upper-right position, the coordinates of the lower-left position, and the coordinates of the lower-right position are represented as (0, 0), (3, 0), (0, 3), and (3, 3), respectively, the coefficient scanning is performed in the following order: (0, 0), (0, 1), (1, 0), (0, 2), (1, 1), . . . (3, 3). L and U indicate two coefficients neighboring x. Each of the positions of coefficients L and U neighbors the position of coefficient x. When no orthogonal transform is applied, the three positions of coefficients x, L, and U correspond to three pixel positions, respectively.

In this case, in the example in FIG. 58, a sum of the sig_flag of coefficient L and the sig_flag of coefficient U is used as the context number for encoding the sig_flag of coefficient x. In other words, the three context numbers are used selectively. In addition, a single fixed context number is used for each of parity_flag and gtX_flag (X in gtX is, for example, 1, 3, 5, 7, or 9).

In other words, in FIG. 58, only one context number is used for the coefficient information flag other than sig_flag. In general, in a block in which no orthogonal transform is applied, there is a tendency that pixels arranged in a horizontal or vertical direction have a correlation. However, when only one context number is used, no context number corresponding to the tendency is selected.

For example, when gt3_flag is to be encoded, there is a case where a coefficient for which gt3_flag has been encoded among a plurality of encoded coefficients is not present in a horizontal line or a vertical line in which a current coefficient to be encoded is present. In this case, there is a high possibility that another value of gt3_flag encoded in the past and the value of gt3_flag of the current coefficient are different from each other. As a result, an appropriate appearance probability of the value of gt3_flag of the current coefficient is not used, which may reduce the compression efficiency.

[A First Example in Aspect 4 Relating to Coefficient Encoding]

FIG. 60 is a conceptual diagram indicating neighboring coefficients according to a first example in Aspect 4. In FIG. 60, x denotes a current coefficient to be encoded. Each of x0, x1, and x2 indicates a corresponding one of three encoded coefficients neighboring x. When no orthogonal transform is applied, the four positions of coefficients x, x0, x1, and x2 correspond to four pixel positions, respectively. Hereinafter, each of x, x0, x1, and x2 may indicates a coefficient absolute value which is the absolute value of a coefficient.

In this case, based on the three neighboring coefficient absolute values x0, x1, and x2, pred which is a prediction value of x is defined as indicated below.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 4} \right\rbrack \\ {{pred} = \left\{ \begin{matrix} {\max\left( {{x\; 1},{x\; 2}} \right)} & \left( {{x\; 0} \leqq {\min\left( {{x\; 1},{x\; 2}} \right)}} \right) & \; & \; & \; & \; & \; & \; & \; & \; & \mspace{14mu} & {\mspace{25mu}\left( {3A} \right)} \\ {\min\left( {{x\; 1},{x\; 2}} \right)} & \left( {{x\; 0} \geqq {\max\left( {{x\; 1},{x\; 2}} \right)}} \right) & \; & \; & \; & \; & \; & \; & \; & \; & \; & {\mspace{25mu}\left( {3B} \right)} \\ {{x\; 1} + {x\; 2} - {x\; 0}} & ({otherwise}) & \; & \; & \; & \; & \; & \; & \; & \; & \; & {\mspace{25mu}\left( {3C} \right)} \end{matrix} \right.} \end{matrix}$

However, when there is no neighboring pixel because x is located at a block boundary, pred is calculated assuming that the coefficient of a neighboring pixel is 0.

When no orthogonal transform is applied to a block, there is a tendency that the block has an edge in a vertical or horizontal direction. Here, the edge is a group of pixels in a part in which each pixel has a large pixel value compared with pixels surrounding the part. It is expected that a prediction accuracy for pred described above is high in both the case where coefficient x is on an edge and the case where coefficient x is not on an edge. The reasons are indicated below.

FIG. 61A is a conceptual diagram indicating a current coefficient to be encoded that is present in a position in an edge in a horizontal direction. In FIG. 61A, the hatched part is an edge, and x is on the edge. In this case, x1 is larger than or equal to x0, and the possibility that a conditional expression (3A) is satisfied is high according to the calculation condition for pred. In this case, since x1 is larger than or equal to x2, pred=x1 is satisfied. In other words pred for x on the edge is calculated as x1 on the edge.

FIG. 61B is a conceptual diagram indicating the current coefficient that is present in a position in an edge in a vertical direction. According to the same reasoning that applies also in FIG. 61B, pred is calculated as x2 on the edge. Specifically, in FIG. 61B, the hatched part is an edge, and x is on the edge. In this case, x2 is larger than or equal to x0, and the possibility that a conditional expression (3A) is satisfied is high according to the calculation condition for pred. In this case, since x2 is larger than or equal to x1, pred=x2 is satisfied. In other words pred for x on the edge is calculated as x2 on the edge.

FIG. 62A is a conceptual diagram indicating a current coefficient to be encoded that is present neighboring a position in an edge in a horizontal direction. In FIG. 62A, the hatched part is an edge, and x is outside the edge. In this case, x0 is on the edge, and is larger than x1, and thus the possibility that a conditional expression (3B) is satisfied is high according to the calculation condition for pred. In this case, since x2 is larger than or equal to x1, pred=x1 is satisfied. In other words, pred for x outside the edge is calculated as x1 outside the edge.

FIG. 62B is a conceptual diagram indicating a current coefficient to be encoded that is present neighboring a position in an edge in a vertical direction. According to the same reasoning that applies also in FIG. 62B, pred is calculated as x2 outside the edge. Specifically, in FIG. 62B, the hatched part is an edge, and x is outside the edge. In this case, x0 is on the edge, and is larger than x2, and thus the possibility that the conditional expression (3B) is satisfied is high according to the calculation condition for pred. In this case, since x1 is larger than or equal to x2, pred=x2 is satisfied. In other words, pred for x outside the edge is calculated as x2 outside the edge.

It is to be noted that when no edge is present around x, it is assumed that x corresponds to a value that is variable smoothly from the pixels of x0, x1, and x2. Accordingly, as in a conditional expression (3C), the value obtainable according to x1+x2−x0 corresponding to a plane prediction value is calculated as the value of pred.

In this example, the context number of sig_flag of coefficient x is determined based on pred described above. Although a syntax in the first example in Aspect 3 is used as a syntax for coefficient encoding, another syntax may be used.

The minimum value for the coefficient absolute values represented as x0, x1, and x2 neighboring x is estimated based only on a plurality of coefficient information flags processed in a first loop process. In other words, when y0, y1, and y2 are original coefficient absolute values, the estimated minimum value for x0, x1, and x2 are represented as indicated below. Here, a % b indicates a remainder obtainable by dividing a by b.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 5} \right\rbrack & \; \\ {{{x\; 0} = {\min\left( {{y\; 0},{11 - {!\left( {y\; 0\%\mspace{14mu} 2} \right)}}} \right)}}{{x\; 1} = {\min\left( {{y\; 1},{11 - {!\left( {y\; 1\%\mspace{14mu} 2} \right)}}} \right)}}{{x2} = {\min\left( {{y\; 2},{11 - {!\left( {y\; 2\%\mspace{14mu} 2} \right)}}} \right)}}} & (4) \end{matrix}$

Using these three values, pred is calculated. Here, pred is a prediction value of the minimum value for x estimated based only on the plurality of coefficient information flags processed in the first loop process, and is specifically a prediction value of a value according to min(x,11−!(x % 2)). In addition, sig_ctx which is the context number of sig_flag of coefficient x is defined as indicated below.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 6} \right\rbrack & \; \\ {{{sig}\_{ctx}} = \left\{ \begin{matrix} {0\ } & \left( {{pred}\  = 0} \right) \\ {1\ } & \left( {{pred}\  > 0} \right) \end{matrix} \right.} & (5) \end{matrix}$

In FIG. 58, the context number of sig_flag is determined, and thus three kinds of context numbers are used selectively using the two left and upper coefficients. In this example, two kinds of context numbers are used selectively using the three coefficients neighboring the current coefficient.

It is to be noted that, in this example, pred which is the prediction value for the current coefficient is calculated using the three coefficients neighboring the current coefficient. The number of neighboring coefficients for calculating pred may be another number of neighboring coefficients. Alternatively, three coefficients may be obtained from positions different from the positions in this example. Alternatively, the method for calculating pred may be changed. Alternatively, coefficient absolute values x0, x1, and x2 may be estimated using all the flags in the same loop process, or may be estimated using only a part of the flags.

In the example in FIG. 58, one context number is used for each of the coefficient information flags other than sig_flag. However, a plurality of context numbers may be selectively used for the coefficient information flags other than sig_flag, according to a method similar to the method in this example. For example, parity_ctx and gtX_ctx (X in gtX is, for example, 1, 3, 5, 7, or 9) which are context numbers of parity_flag and gtX_flag of x which is a current coefficient to be encoded may be derived as indicated below.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 7} \right\rbrack & \; \\ {{{par}\;\_\;{ctx}} = \left\{ \begin{matrix} 0 & \left( {{pr{ed}\%\mspace{14mu} 2}\  = 0} \right) \\ 1 & \left( {{pr{ed}\%\mspace{14mu} 2}\  = 1} \right) \end{matrix} \right.} & (6) \\ \left\lbrack {{Math}.\mspace{14mu} 8} \right\rbrack & \; \\ {{{gtX}\;\_\;{ctx}} = \left\{ \begin{matrix} {0\ } & \left( {{pred}\  \leqq X} \right) \\ {1\ } & \left( {{pred}\  > X} \right) \end{matrix} \right.} & (7) \end{matrix}$

In this example, a context number of each coefficient information flag is selected based on the value of pred, from two kinds of context numbers. The two kinds of context numbers may be commonalized by a plurality of coefficient information flags different from each other. Alternatively, coefficient information flags for which context numbers are determined according to another determination method may be present. For example, the method in FIG. 58 may be used as the method of determining the context number of sig_flag and the method in this example may be used as the method of determining the context number of each of the other coefficient information flags. Alternatively, the determination methods may be switched.

[Effects of the First Example in Aspect 4 Relating to Coefficient Encoding]

As described above, there is a possibility that the prediction accuracy of the coefficient regarding pred is high. Accordingly, for example, switching of context numbers based on whether or not pred which is the prediction value regarding gtX_ctx is larger than or smaller than X (X in gtX) may produce a possibility that an appropriate occurrence probability is used and a possibility that the compression rate is high. Furthermore, as for sig_flag, this example produces a possibility that the compression rate becomes high according to the high prediction accuracy of the coefficient, compared with the example in which two neighboring coefficients as in FIGS. 58 and 59 are used.

[A Second Example in Aspect 4 Relating to Coefficient Encoding]

In the first example in Aspect 4, prediction value pred is used in order to select the context number of the coefficient information flag relating to coefficient x. The prediction value pred is calculated using the value of the plurality of kinds of coefficient information flags which have been already encoded in the loop process in which the coefficient information flags are encoded.

In this example, values of coefficient information flags to be encoded for a current coefficient to be encoded are values of three coefficient information flags for three coefficients which neighbor the current coefficient. The values of the three coefficient information flags are predicted using values of same kinds of three coefficient information flags as the coefficient information flags to be encoded.

For example, when gt3_flag for current coefficient x to be encoded is encoded, gt3_flag_pred which is a prediction value of gt3_flag is calculated as indicated below. Here, x0, x1, and x2 are three coefficients neighboring x as illustrated in FIG. 60.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 9} \right\rbrack & \; \\ {{{gt}\; 3\;\_\;{flag}\;\_\;{pred}} = \left\{ \begin{matrix} {\max\left( {{{gt}\; 3\;\_\;{{flag}\left\lbrack {x\; 1} \right\rbrack}},{{gt}\; 3\;\_\;{{flag}\left\lbrack {x\; 2} \right\rbrack}}} \right)} & \left( {{{gt}\; 3\;\_\;{{flag}\left\lbrack {x\; 0} \right\rbrack}} \leqq {\min\left( {{{gt}\; 3\;\_\;{{flag}\left\lbrack {x\; 1} \right\rbrack}},{{gt}\; 3\;\_\;{{flag}\left\lbrack {x\; 2} \right\rbrack}}} \right)}} \right) \\ {\min\left( {{{gt}\; 3\_\;{{flag}\left\lbrack {x\; 1} \right\rbrack}},{{gt}\; 3\;\_\;{{flag}\left\lbrack {x\; 2} \right\rbrack}}} \right)} & \left( {{{gt}\; 3\;\_\;{{flag}\left\lbrack {x\; 0} \right\rbrack}} \geqq {\min\left( {{{gt}\; 3\;\_\;{{flag}\left\lbrack {x\; 1} \right\rbrack}},{{gt}\; 3\;\_\;{{flag}\left\lbrack {x\; 2} \right\rbrack}}} \right)}} \right) \end{matrix} \right.} & (8) \end{matrix}$

Next, gt3_flag_pred is defined as gt3_ctx which is a context number of gt3_flag for coefficient x.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 10} \right\rbrack & \; \\ {{{{gt}\; 3\;\_\;{ctx}} = {{gt}\; 3\;\_\;{flag}\;\_\;{pred}}}\;} & (9) \end{matrix}$

It is to be noted that each of the values of the three flags gt3_flag for the three neighboring coefficients to be used for prediction and each of the prediction values gt3_flag_pred is 0 or 1. Accordingly, gt3_flag_pred is represented using only bit computation as indicated below.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 11} \right\rbrack & \; \\ {{{gt}\; 3\_\;{flag}\;\_\;{pred}} = {{\left( {141 ⪢ \left( {{4{gt}\; 3\;\_\;{{flag}\left\lbrack {x\; 0} \right\rbrack}} + {2{gt3}\;\_\;{{flag}\left\lbrack {x\; 1} \right\rbrack}} + {4{gt}\; 3\;\_\;{{flag}\left\lbrack {x\; 2} \right\rbrack}}} \right)} \right)\&}1}} & (10) \end{matrix}$

Likewise, a prediction value of each of coefficient information flags sig_flag, parity_flag, gt1_flag, gt5_flag, gt7_flag, and gt9_flag is also calculated according to the above-described method. Next, the context number is defined.

It is to be noted that the number of coefficients to be used for prediction of coefficient information flags may be changed, or positions of coefficients may be changed. In addition, the method of predicting coefficient information flags may be changed. In addition, the number of candidate context numbers for coefficient information flags may be increased.

[Effects of the Second Example in Aspect 4 Relating to Coefficient Encoding]

Likewise the prediction of the coefficient information flags in the first example in Aspect 4, also in the prediction of the coefficient information flags in the second example in Aspect 4, there is a possibility that the resulting prediction accuracy becomes high both in the case where a coefficient is on an edge and in the case where a coefficient is not on an edge. As a result, there is a possibility that the resulting cabac compression rate is high.

Furthermore, since the prediction values of the coefficient information flags are calculated only by the bit computation, there is a possibility that the resulting processing amount is reduced more than the processing amount required when performing the calculation of pred in the first example in Aspect 4.

[A Third Example in Aspect 4 Relating to Coefficient Encoding]

This example also relates to a processing flow in the case where no orthogonal transform is applied in the example in FIG. 47. Although a syntax in the first example in Aspect 3, that is the example in FIG. 56 is used as a syntax for coefficient encoding, another syntax may be used. In the example in FIG. 56, remainder which is a remainder of a coefficient that is not represented by a coefficient information flag is encoded with Golomb-Rice code. The explanation for remainder is as described in Aspect 1 relating to coefficient encoding.

In this example, pred is used for selection of a Rice parameter to be used in Golomb-Rice coding. Here, pred is a value to be predicted using three coefficients which neighbor a current coefficient to be encoded as described in the first example in Aspect 4.

First, the outline of Golomb-Rice coding is explained. In the encoding of remainder, an approach what is called Golomb-Rice coding is used. In the Golomb-Rice coding, the value of remainder is binarized using a prefix and a suffix.

Rice code is used for the prefix. In addition, encoding methods are switched by Rice parameter g (for example, g is a ternary of 0, 1, or 2). In addition, unary code and exponential Golomb code are used for the suffix.

FIG. 63 is a conceptual diagram indicating correspondences between residual values and Golomb-Rice code according to the third example in Aspect 4. Specifically, FIG. 63 indicates the encoded bin of each of the prefix and the suffix in the case where remainder is encoded by Golomb-Rice coding, according to the value of a Rice parameter.

Here, x denotes a current coefficient to be encoded. Here, x may denote the absolute value of the coefficient. Here, remainder [x] denotes remainder of x in the processing flow in FIG. 49. Each of remainder [x0], remainder [x1], and remainder [x2] denotes a corresponding one of three remainders of three coefficients which neighbor x in FIG. 60.

In addition, when any one of these three coefficients neighboring the coefficient to be encoded is represented as one or more coefficient information flags, that is, when no remainder has occurred for the one neighboring coefficient, remainder of the coefficient may be represented as 0. Next, prediction value remainder_pred for remainder [x] is defined as indicated below.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 12} \right\rbrack & \; \\ {{{remainder}\;\_\;{pred}} = \left\{ \begin{matrix} {\max\left( {{{remainder}\left\lbrack {x\; 1} \right\rbrack},{{remainder}\left\lbrack {x\; 2} \right\rbrack}} \right)} & \left( {{{remainder}\left\lbrack {x\; 0} \right\rbrack} \leqq {\min\left( {{{remainder}\left\lbrack {x\; 1} \right\rbrack},{{remainder}\left\lbrack {x\; 2} \right\rbrack}} \right)}} \right. \\ {\min\left( {{{remainder}\left\lbrack {x\; 1} \right\rbrack},{{remainder}\left\lbrack {x\; 2} \right\rbrack}} \right)} & \left( {{{remainder}\left\lbrack {x\; 0} \right\rbrack} \geqq {\max\left( {{{remainder}\left\lbrack {x\; 1} \right\rbrack},{{remainder}\left\lbrack {x\; 2} \right\rbrack}} \right)}} \right. \\ {{{{remainder}\left\lbrack {x\; 1} \right\rbrack} + {{remainder}\left\lbrack {x\; 2} \right\rbrack} - {{remainder}\left\lbrack {x\; 0} \right\rbrack}}\mspace{14mu}} & ({otherwise}) \end{matrix} \right.} & (11) \end{matrix}$

Next, Rice parameter r to be used for Golomb-Rice coding of remainder [x] is derived as indicated below.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 13} \right\rbrack & \; \\ \begin{matrix} {r = {rice_{-}pa{r\left\lbrack {re{mainder}\;\_\;{pred}} \right\rbrack}}} & \; \end{matrix} & (12) \end{matrix}$

In this case, a Rice parameter table may be defined as indicated below, for example.

$\begin{matrix} {{rice}\;\_\;{par}{= \left\{ {0,0,0,1,1,1,2,2,2} \right\}}} & (13) \end{matrix}$

It is to be noted that the number of coefficients to be used for prediction of remainder [x] may be changed, or positions of coefficients to be used for prediction of remainder [x] may be changed. The method for calculating remainder_pred may be changed. In addition, the values of the Rice parameter table may be changed. A calculation method different from the methods for calculating the Rice parameter described above may be used. The third example in Aspect 4 may be used in combination with the first example in Aspect 4, the second example in Aspect 4, or any other aspect.

Parameter remainder_pred may be derived based not on remainder of coefficients neighboring a current coefficient to be encoded but on the absolute values of coefficients neighboring a current coefficient to be encoded as in the first example in Aspect 4.

Specifically, remainder_pred which is a prediction value of x may be derived based on three absolute values x0, x1, and x2 of three coefficients neighboring a current coefficient to be encoded, according to a method similar to the method explained with reference to FIG. 60. Next, a Rice parameter may be derived using remainder_pred according to the above-described method.

In the above case, remainder_pred is large because remainder_pred is based not on remainder of each of the coefficients and on the absolute values of the coefficients. Accordingly, the Rice parameter table may be designed in such a manner that the Rice parameter corresponding to remainder_pred based on the absolute values of the neighboring coefficients is smaller than the Rice parameter for remainder_pred based on remainder of each of the neighboring coefficients.

Alternatively, remainder_pred may be converted to remainder_pred′ as described below, for example. Next, the same table as the table for deriving the Rice parameter for remainder_pred based on remainder may be used as the table for deriving the Rice parameter for remainder_pred′.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 15} \right\rbrack & \; \\ \begin{matrix} {{{remainder}\;\_\;{pred}^{\prime}} = {\left( {{{remainder}\;\_\;{pred}} - 4} \right)/2}} \\ \left( {{{{if}\mspace{14mu}{remainder}\;\_\;{pred}} \leqq 3},\;{{{remainder}\;\_\;{pred}^{\prime}} = 0}} \right) \end{matrix} & (14) \end{matrix}$

[Effects of the Third Example in Aspect 4 Relating to Coefficient Encoding]

Likewise the prediction of the coefficient information flags in the first example in Aspect 4, also in the prediction of the remainder in the third example in Aspect 4, there is a possibility that prediction accuracy becomes high both in the case where a coefficient is on an edge and in the case where a coefficient is not on an edge.

Furthermore, for example, the Rice parameter table is designed in such a manner that the code length of remainder encoded by Golomb-Rice coding using the Rice parameter becomes shortest. The Rise parameter is obtainable according to remainder_pred which is substituted in the Rice parameter table. For this reason, actually, there is a possibility that the code length of remainder encoded by Golomb-Rice coding using the Rice parameter becomes shortest.

[Aspect 5 Relating to Coefficient Encoding]

FIG. 64 is a flow chart indicating a basic coefficient encoding method according to Aspect 5. Specifically, FIG. 64 indicates a coefficient encoding method in an area in which prediction residuals have been obtained in either intra encoding or inter encoding.

The example in FIG. 64 is different from the example in FIG. 47 in that sixteen coefficients in a subblock is encoded using a third encoding scheme in the case where orthogonal transform is applied (S147 b). In other words, in the example in FIG. 64, encoder 100 encodes the sixteen coefficients in the subblock using not a first encoding scheme indicated in FIG. 48 but the third encoding scheme to be described later, when orthogonal transform is applied to a block (S147 b).

FIG. 65 is a flow chart indicating details of the third encoding scheme indicated in FIG. 64. In the third encoding scheme, a plurality of coefficients in a subblock are encoded. At that time, a first loop process (S151 to S156) is performed for each coefficient information flag of a corresponding one of coefficients in the subblock, and a second loop process (S161 to S165) is performed for each coefficient in the subblock.

In the first loop process (S151 to S156), one or more coefficient information flags are sequentially encoded as in the first encoding scheme indicated in FIG. 48. The one or more coefficient information flags may include sig_flag, gt1_flag, parity_flag, and gt3_flag. The one or more coefficient information flags are sequentially encoded by CABAC coding within a range in which CCB does not exceed thres, and CCB is counted up one-by-one each time of encoding. No coefficient information flag is encoded after CCB exceeds thres,

In the second loop process (S161 to S165), remainder that is a remainder value which is not represented by a coefficient information flag (that is a remainder value for reconstructing the value of the coefficient using the coefficient information flag) is encoded by Golomb-Rice coding for the coefficient for which the coefficient information flag has been encoded. A coefficient for which no coefficient information flags has been encoded is to be subjected to a conversion process to be described later (S164 a), and then encoded by Golomb-rice coding (S164 b). It is to be noted that remainder may be encoded using another encoding scheme instead of using Golomb-Rice coding.

In other words, in the second loop process (S161 to S165), encoder 100 determines whether a coefficient information flag corresponding to a processing-target coefficient has been encoded (S162), as in the first encoding scheme indicated in FIG. 48. When a coefficient information flag has been encoded (Yes in S162), encoder 100 encodes remainder by Golomb-Rice coding (S163).

When no coefficient information flag has been encoded (No in S162) in the third encoding scheme indicated in FIG. 65, encoder 100 applies a to-be-described conversion process what is called a zeropos process or a poszero process to a value of a coefficient (S164 a). Next, encoder 100 encodes the value of the coefficient by Golomb-Rice coding (S164 b).

The total number of loop processes is two here, but it is to be noted that the total number of loop processes may be different from two.

Next, an example of the above-described conversion process (S164 a) is described with reference to FIG. 66 and FIG. 67.

FIG. 66 is a conceptual diagram indicating a plurality of neighboring coefficients according to Aspect 5. Coefficient scanning is performed diagonally starting with the 4x4 subblock located at the lower-right position illustrated in FIG. 66. Specifically, in a coordinate system in which the coordinates of the upper-left position, the coordinates of the upper-right position, the coordinates of the lower-left position, and the coordinates of the lower-right position are represented as (0, 0), (3, 0), (0, 3), and (3, 3), respectively, the coefficient scanning is performed in, for example, the following order: (3, 3), (3, 2), (2, 3), (3, 1), (2, 2), . . . (0, 0).

In addition, a denotes a current coefficient to be encoded (that is, a processing target). In addition, a0, a1, a2, a3, and a4 denote five encoded (that is, processed) coefficients neighboring coefficient a. Hereinafter, each of a, a0, a1, a2, a3, and a4 may indicate a value of a coefficient, and more specifically, each of them may indicate an absolute value of the coefficient.

Encoder 100 obtains sum which is a total sum of the absolute values of five coefficients a0, a1, a2, a3, and a4. Next, encoder 100 determines a value what is called poszero according to sum. For example, encoder 100 may determine poszero corresponding to sum, with reference to a look-up table.

Next, encoder 100 compares value a with poszero. Next, encoder 100 converts value a into value b that is determined as indicated below.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 16} \right\rbrack & \; \\ {b = \left\{ \begin{matrix} {poszero} & \left( {a = 0} \right) \\ {a - 1} & \left( {o < a \leqq {poszero}} \right. \\ a & \left( {a > {poszero}} \right) \end{matrix} \right.} & (15) \end{matrix}$

Lastly, encoder 100 encodes value b obtained through conversion on value a, by Golomb-rice coding.

FIG. 67 is a conceptual diagram indicating a conversion process according to Aspect 5. In the example in FIG. 67, poszero is 4. When value a is 0, value b is poszero (that is, 4). When value a is greater than 0 and less than or equal to poszero (that is, less than or equal to 4), value b is obtained according to a −1. When value a is greater than poszero (that is, greater than 4), value b equals to value a. In this way, value b is uniquely defined by value a.

In addition, as indicated in FIG. 67, value a is to be uniquely defined when value b is defined. Accordingly, decoder 200 may decode value b by Golomb-rice decoding, and convert decoded value b into value a. For example, decoder 200 may derive value a by converting value b into value a that is determined as indicated below.

$\begin{matrix} \left\lbrack {{Math}.\mspace{14mu} 17} \right\rbrack & \; \\ {a = \left\{ \begin{matrix} 0 & \left( {b = {poszero}} \right) \\ {b + 1} & \left( {0 \leqq b < {poszero}} \right) \\ b & \left( {b > {poszero}} \right) \end{matrix} \right.} & (16) \end{matrix}$

It is to be noted that a plurality of neighboring coefficients for determining poszero are not limited to the above five coefficients. Coefficients located at positions different from the positions of the above five coefficients may be used as neighboring coefficients for determining poszero. In addition, in order to determine poszero, six or more neighboring coefficients may be used, four or less neighboring coefficients may be used, or only one neighboring coefficient may be used. For example, poszero may be determined according to a total sum of absolute values of two coefficients a3 and a4.

In addition, poszero may be determined according to sum and information other than sum.

In addition, in the example of FIG. 66, positions of neighboring coefficients for determining poszero are determined according to the scan order from the lower-right position. However, when the scan order is opposite, the positions of neighboring coefficients for determining poszero may be reversed.

In general, a rate of appearance of a coefficient having a value of 0 (a zero coefficient) decreases in an area in which orthogonal transform is applied when CCB exceeds a limit than when CCB does not exceed the limit. For this reason, when the value of the coefficient is greater than 0 and less than or equal to poszero, a process of subtracting 1 from the value is performed. In this way, the amount of codes generated by following Golomb-rice coding is reduced. As a result, the coding efficiency increases.

Next, one example of Golomb-rice coding (S164 b) of a coefficient to which a conversion process (S164 a) has been applied is described with reference to FIG. 66. For example, in Golomb-rice coding (S164 b), five neighboring coefficients a0, a1, a2, a3, and a4 are used, as in the conversion process (S164 a).

Specifically, encoder 100 obtains sum which is a total sum of the absolute values of five coefficients a0, a1, a2, a3, and a4. Next, encoder 100 determines Rice parameter r according to sum. For example, encoder 100 may determine Rice parameter r corresponding to sum, with reference to a look-up table.

Encoder 100 encodes value b by Golomb-rice coding described with reference to FIG. 63. At that time, encoder 100 uses Rice parameter r determined according to sum, for Golomb-rice coding.

It is to be noted that a plurality of neighboring coefficients for determining Rice parameter r are not limited to the above five coefficients. Coefficients located at positions different from the positions of the above five coefficients may be used as neighboring coefficients for determining Rice parameter r. In addition, in order to determine Rice parameter r, six or more neighboring coefficients may be used, four or less neighboring coefficients may be used, or only one neighboring coefficient may be used. For example, Rice parameter r may be determined according to a total sum of absolute values of two coefficients a3 and a4.

In addition, the plurality of neighboring coefficients for determining Rice parameter r may be the same as or different from the plurality of neighboring coefficients for determining poszero.

In addition, Rice parameter r may be determined according to sum and information other than sum.

In addition, in the example of FIG. 66, positions of neighboring coefficients for determining Rice parameter r are determined according to the scan order from the lower-right position. However, when the scan order is opposite, the positions of neighboring coefficients for determining Rice parameter r may be reversed.

In general, there is a tendency that the values of coefficients become greater from high-frequency side to low-frequency side in an area in which orthogonal transform has been applied. Accordingly, determining Rice parameter r for encoding a coefficient by Golomb-rice coding according to the values of neighboring coefficients produces a possibility that the encoding efficiency increases.

[A First Example in Aspect 5 Relating to Coefficient Encoding]

FIG. 68 is a flow chart indicating a coefficient encoding method according to a first example in Aspect 5. Specifically, FIG. 68 indicates a coefficient encoding method in an area in which prediction residuals have been obtained in either intra encoding or inter encoding.

The example in FIG. 68 is different from the example in FIG. 64 in that sixteen coefficients in a subblock is encoded using a third encoding method in the case where no orthogonal transform is applied (S127 b). In other words, in the example of FIG. 68, encoder 100 encodes the sixteen coefficients in the subblock using not the second encoding scheme indicated in FIG. 49 but the third encoding scheme described above also in the case where no orthogonal transform is applied to the block (S127 b).

It is to be noted that the syntax for encoding the coefficient information flag in the first loop process in FIG. 65 may be different between when orthogonal transform is applied and when no orthogonal transform is applied. For example, part or all of the coefficient information flags may be different between one or more coefficient information flags in the case where orthogonal transform is applied and one or more coefficient information flags in the case where no orthogonal transform is applied.

[Effects of the First Example in Aspect 5 Relating to Coefficient Encoding]

According to the example in FIG. 68, there is a possibility that the syntaxes for use in encoding of the sixteen coefficients in the subblock are commonalized after CCB exceeds thres regardless of application or non-application of orthogonal transform even when the syntaxes for use in encoding of the coefficient information flags are different depending on whether or not orthogonal transform is applied. In this way, there is a possibility that part of the circuits is commonalized, and thus the circuit scales are reduced.

It is to be noted that part or all of the encoding processes (S127 b and S147 b) of the sixteen coefficients in the subblock may be different between when orthogonal transform is applied and when no orthogonal transform is applied. For example, the number of neighboring coefficients to be used to calculate poszero and Rice parameter r in the encoding processes (S127 b and S147 b) of the sixteen coefficients in the subblock may be different between when orthogonal transform is applied and when no orthogonal transform is applied.

In addition, the number of neighboring coefficients to be used to calculate poszero may be different from the number of neighboring coefficients to be used to calculate Rice parameter r.

In addition, the positions of neighboring coefficients to be used to calculate poszero and Rice parameter r may be determined according to a scan order in the case where orthogonal transform is applied and a scan order in the case where no orthogonal transform is applied. For example, when the scan orders are different, the positions of neighboring coefficients to be used to calculate poszero and the positions of neighboring coefficients to be used to calculate Rice parameter r may be different from each other.

[A Second Example in Aspect 5 Relating to Coefficient Encoding]

FIG. 69 is a flow chart indicating a coefficient encoding method according to a second example in Aspect 5. Specifically, FIG. 69 indicates a coefficient encoding method in an area in which prediction residuals have been obtained in either intra encoding or inter encoding.

The example in FIG. 69 is different from the example in FIG. 64 in that sixteen coefficients in a subblock is encoded using a first encoding method in the case where no orthogonal transform is applied (S127 a). Specifically, in the example in FIG. 69, encoder 100 encodes the sixteen coefficients in the subblock using either the second encoding scheme or the third encoding scheme but the first encoding scheme indicated in FIG. 48 when no orthogonal transform is applied to a block (S127 a).

For example, in the third encoding scheme, the conversion process (S164 a) indicted in FIG. 65 is performed. On the other hand, in the first encoding scheme, the conversion process (S164 a) indicted in FIG. 65 is performed. In this point, the first encoding scheme is different from the third encoding scheme. Except for the point, the first encoding scheme may be the same as the third encoding scheme.

It is to be noted that the syntax for encoding the coefficient information flag in the first loop process in each of FIG. 48 and FIG. 65 may be different between when orthogonal transform is applied and when no orthogonal transform is applied. For example, part or all of the coefficient information flags may be different between one or more coefficient information flags in the case where orthogonal transform is applied and one or more coefficient information flags in the case where no orthogonal transform is applied.

[Effects of the Second Example in Aspect 5 Relating to Coefficient Encoding]

In the example in FIG. 69, the syntax for encoding the coefficient information flag may be different between when orthogonal transform is applied and when no orthogonal transform is applied. On the other hand, there is a possibility that the syntax for encoding the sixteen coefficients in the subblock is commonalized after CCB exceeds thres except for a poszero process. In this way, there is a possibility that part of the circuits is commonalized between when orthogonal transform is applied and when no orthogonal transform is applied, and thus the circuit scales are reduced.

In general, a poszero process is effective for increasing the coding efficiency when orthogonal transform is applied. On the other hand, a poszero process is not effective so much for increasing the coding efficiency when no orthogonal transform is applied. For this reason, a poszero process does not always need to be performed when no orthogonal transform is applied. In this way, there is a possibility that the processing efficiency and the coding efficiency increase.

For example, the number of neighboring coefficients to be used to calculate poszero and Rice parameter r in the third encoding may be different between when orthogonal transform is applied and when no orthogonal transform is applied. In addition, the number of neighboring coefficients to be used to calculate poszero may be different from the number of neighboring coefficients to be used to calculate Rice parameter r.

In addition, the positions of neighboring coefficients to be used to calculate poszero and Rice parameter r may be determined according to a scan order in the case where orthogonal transform is applied and a scan order in the case where no orthogonal transform is applied. For example, when the scan orders are different, the positions of neighboring coefficients to be used to calculate poszero and the positions of neighboring coefficients to be used to calculate Rice parameter r may be different from each other.

[Variation of Coefficient Encoding]

Any of the aspects and examples regarding coefficient encoding described above may be combined. Alternatively, any of the aspects, examples, and combinations regarding coefficient encoding described above may be applied to luminance blocks or may be applied to chrominance blocks. At the time, thres used for luminance blocks and thres used for chrominance blocks may be different.

Alternatively, any of the aspects, examples, and combinations regarding coefficient encoding described above may be used for a block to which no orthogonal transform is applied and Block-based Delta Pulse Code Modulation (BDPCM) is applied. In the block to which BDPCM is applied, a residual signal vertically or horizontally neighboring a residual signal in the block is subtracted from the residual signal, which reduces the information amount.

Furthermore, any of the aspects, examples, and combinations regarding coefficient encoding described above may be used for a chrominance block to which BDPCM is applied.

Alternatively, any of the aspects, examples, and combinations regarding coefficient encoding described above may be used for a chrominance block to which Intra Sub-Partitions (ISP) are applied. In ISP, an intra block is split vertically or horizontally, and intra prediction for each current subblock is performed using a pixel value of a subblock neighboring the current subblock.

Furthermore, any of the aspects, examples, and combinations regarding coefficient encoding described above may be used for a chrominance block to which ISP is applied.

Furthermore, any of the aspects, examples, and combinations regarding coefficient encoding described above may be used when Chroma Joint Coding is used as an encoding mode for a chrominance block. Here, when Chroma Joint Coding is an encoding method for deriving the value of Cr from the value of Cb.

In addition, the value of thres in the case where orthogonal transform is applied may be double the value of thres in the case where no orthogonal transform is applied. Alternatively, the value of thres in the case where no orthogonal transform is applied may be double the value of thres in the case where orthogonal transform is applied.

Alternatively, only in the case where Chroma Joint Coding is used, the value of thres for CCB in the case where orthogonal transform is applied may be double the value of thres for CCB in the case where no orthogonal transform is applied. Alternatively, only in the case where Chroma Joint Coding is used, the value of thres of a CCB in the case where no orthogonal transform is applied may be double the value of thres of a CCB in the case where orthogonal transform is applied.

In addition, in the aspects and examples regarding coefficient encoding described above, the scanning order of coefficients in a block to which no orthogonal transform is applied may be the same as the scanning order of coefficients in a block to which orthogonal transform is applied.

Furthermore, although some examples of syntaxes are indicated in Aspect 3 and the examples in Aspect 3, syntaxes to be applied are not limited to the examples. For example, in aspects different from Aspect 3 and examples in the aspects, syntaxes different from the syntaxes indicated in Aspect 3 and the examples may be used. Various syntaxes for encoding sixteen coefficients can be applied.

Although encoding processing flow is indicated in each of the aspects and examples regarding coefficient encoding, it is to be noted that a decoding processing flow is basically the same as the encoding processing flow except for the difference between transmission and reception of a bitstream. For example, decoder 200 may perform inverse orthogonal transform and decoding corresponding to orthogonal transform and encoding that are performed by encoder 100.

In addition, each of the flow charts relating to the aspects and examples regarding coefficient encoding are examples. New conditions or processes may be added to each of the flow charts, or some of the conditions or processes in each of the flow charts may be deleted or modified.

In addition, here, a coefficient is a value included in an image of a block or a subblock. Specifically, coefficients included in an image may be obtained from pixel values of the image through orthogonal transform. Specifically, coefficients included in an image may be obtained from pixel values of the image through orthogonal transform. In other words, the coefficients included in the image may be the pixel values themselves of the image. Alternatively, each pixel value may be a pixel value in an original image or may be a value of a prediction residual. In addition, the coefficient may be quantized.

[Representative Examples of Configuration and Processing]

Representative examples of configurations of encoder 100 and decoder 200 and processes performed thereby as described above are indicated below.

FIG. 70 is a flow chart indicating an operation performed by encoder 100. For example, encoder 100 includes circuitry and memory coupled to the circuitry. The circuitry and memory included in encoder 100 may correspond to processor a1 and memory a2 illustrated in FIG. 40. The circuitry of encoder 100 performs an operation indicated in FIG. 70. More specifically, the circuitry of encoder 100 encodes a block in an image in operation (S211).

For example, the circuitry of encoder 100 may limit the total number of processes of context adaptive coding, and encode a block in an image.

Furthermore, when the total number of processes is within an allowable range for the total number of processes in both a case where orthogonal transform is applied to the block and a case where no orthogonal transform is applied to the block, a coefficient information flag may be encoded by context adaptive coding. When the total number of processes is not within the allowable range for the total number of processes in both the cases, encoding of the coefficient information flag may be skipped. Here, the coefficient information flag indicates an attribute of a coefficient included in the block.

When the coefficient information flag is encoded in both the cases, remainder value information may be encoded by Golomb-rice coding. Here, remainder value information is information for reconstructing a value of the coefficient using the coefficient information flag.

when the encoding of the coefficient information flag is skipped in the case where orthogonal transform is applied to the block, a conversion process may be performed, and the value of the coefficient may be encoded by Golomb-rice coding. When the encoding of the coefficient information flag is skipped in the case where no orthogonal transform is applied to the block, the conversion process may be skipped, and the value of the coefficient may be encoded by Golomb-rice coding.

Here, a conversion process is a process for converting the value of the coefficient using a value determined using a neighboring coefficient. In addition, the neighboring coefficient is a coefficient that neighbors a position of the coefficient in the block.

In this way, there is a possibility that encoding of the coefficient information flag is skipped regardless of application or non-application of orthogonal transform and the limitation on the total number of processes of context adaptive coding. Thus, there is a possibility that increase in processing delay is reduced and increase in the amount of codes is reduced. In addition, there is a possibility that the difference between the encoding scheme used for a block to which orthogonal transform is applied and the encoding scheme used for a block to which no orthogonal transform is applied is reduced, and the circuit scale is reduced.

Furthermore, whether or not to convert the value of the coefficient is appropriately controlled using the neighboring coefficient, which produces a possibility that increase in processing delay is reduced and a possibility that increase in the amount of codes is reduced.

In addition, for example, the coefficient information flag may be a flag indicating whether or not the value of the coefficient is larger than 1. In this way, there is a possibility that encoding of the coefficient information flag indicating whether or not the value of the coefficient is larger than 1 is skipped according to the limitation on the total number of processes of context adaptive coding regardless of application or non-application of orthogonal transform. Thus, there is a possibility that increase in processing delay is reduced and increase in the amount of codes is reduced.

The conversion process may include: replacing the value of the coefficient with the value determined using the neighboring coefficient when the value of the coefficient is 0; and decrease the value of the coefficient by subtracting 1 from the value of the coefficient when the value of the coefficient is greater than 0 and less than or equal to the value determined using the neighboring coefficient. In this way, the value of the coefficient is appropriately converted according to neighboring coefficients, which produces a possibility that increase in the amount of codes is reduced.

In addition, the above-described operation that is performed by the circuitry of encoder 100 may be performed by entropy encoder 110 of encoder 100.

FIG. 71 is a flow chart indicating an operation performed by decoder 200. For example, decoder 200 includes circuitry and memory coupled to the circuitry. The circuitry and memory included in decoder 200 may correspond to processor b1 and memory b2 illustrated in FIG. 46. The circuitry of decoder 200 performs an operation indicated in FIG. 71. More specifically, the circuitry of decoder 200 decodes a block in an image in operation (S221).

In an example, the circuitry of decoder 200 may limit a total number of processes of context adaptive decoding, and decodes a block in an image.

Furthermore, when the total number of processes is within an allowable range for the total number of processes in both a case where inverse orthogonal transform is applied to the block, and a case where no inverse orthogonal transform is applied to the block, a coefficient information flag may be decoded by context adaptive decoding. When the total number of processes is not within the allowable range for the total number of processes in both the cases, decoding of the coefficient information flag may be skipped. Here, the coefficient information flag indicates an attribute of a coefficient included in a block.

When the coefficient information flag is decoded in both the cases, remainder value information may be decoded by Golomb-rice decoding. Here, remainder value information is information for reconstructing a value of the coefficient using the coefficient information flag. Furthermore, the value of the coefficient may be derived using the coefficient information flag and the remainder value information.

Furthermore, when the decoding of the coefficient information flag is skipped in the case where inverse orthogonal transform is applied to the block, the value of the coefficient may be decoded by Golomb-rice decoding. Next, a conversion process may be performed so that the value of the coefficient is derived. Furthermore, when the decoding of the coefficient information flag is skipped in the case where no inverse orthogonal transform is applied to the block, the value of the coefficient may be decoded by Golomb-rice decoding. Next, the value of the coefficient may be derived without performing the conversion process.

Here, a conversion process is a process for converting the value of the coefficient using a value determined using a neighboring coefficient. In addition, the neighboring coefficient is a coefficient that neighbors a position of the coefficient in the block.

In this way, there is a possibility that the coefficient information flag is decoded by context adaptive decoding regardless of application or non-application of inverse orthogonal transform and the limitation on the total number of processes of context adaptive decoding. Thus, there is a possibility that increase in processing delay is reduced and increase in the amount of codes is reduced. In addition, there is a possibility that the difference between the decoding scheme used for a block to which inverse orthogonal transform is applied and the decoding scheme used for a block to which no inverse orthogonal transform is applied is reduced, and the circuit scale is reduced.

Furthermore, whether or not to convert the value of the coefficient is appropriately controlled using the neighboring coefficient, which produces a possibility that increase in processing delay is reduced and a possibility that increase in the amount of codes is reduced.

In addition, for example, the coefficient information flag may be a flag indicating whether or not the value of the coefficient is larger than 1. In this way, there is a possibility that decoding of the coefficient information flag indicating whether or not the value of the coefficient is larger than 1 is skipped according to the limitation on the total number of processes of context adaptive decoding regardless of application or non-application of inverse orthogonal transform. Thus, there is a possibility that increase in processing delay is reduced and increase in the amount of codes is reduced.

The conversion process may include: replacing the value of the coefficient with 0 when the value of the coefficient is equal to the value determined using the neighboring coefficient; and increases the value of the coefficient by adding 1 to the value of the coefficient when the value of the coefficient determined using the neighboring coefficient is less than 0. In this way, the value of the coefficient is appropriately converted according to the neighboring coefficient, which produces a possibility that increase in the amount of codes is reduced.

It is to be noted that the above-described operation that is performed by the circuitry of decoder 200 may be performed by entropy decoder 202 of decoder 200.

Other Examples

Encoder 100 and decoder 200 in each of the above-described examples may be used as an image encoder and an image decoder, respectively, or may be used as a video encoder and a video decoder, respectively.

In addition, encoder 100 and decoder 200 may perform only parts of the above-described operations, and other devices may perform the other parts of the operations. In addition, encoder 100 and decoder 200 may include only constituent elements among the plurality of constituent elements described above, and other devices may include the other constituent elements.

In addition, at least a part of each example described above may be used as an encoding method or a decoding method, or may be used as another method.

In addition, each constituent element may be configured with dedicated hardware, or may be implemented by executing a software program suitable for the constituent element. Each constituent element may be implemented by a program executer such as a CPU or a processor reading and executing a software program recorded on a recording medium such as a hard disc or a semiconductor memory.

More specifically, each of encoder 100 and decoder 200 may include processing circuitry and storage which is electrically coupled to the processing circuitry and is accessible from the processing circuitry. For example, the processing circuitry corresponds to processor a1 or b1, and the storage corresponds to memory a2 or b2.

The processing circuitry includes at least one of the dedicated hardware and the program executer, and executes processing using the storage. In addition, the storage stores a software program which is executed by the program executer when the processing circuitry includes the program executer.

Here, the software which implements either encoder 100, decoder 200, or the like described above is a program as indicated below.

Furthermore, for example, the program may cause a computer to execute an encoding method including: limiting a total number of processes of context adaptive coding, and encodes a block in an image; and in the encoding of the block: in both a case where orthogonal transform is applied to the block, and a case where no orthogonal transform is applied to the block, encoding a coefficient information flag by context adaptive coding when the total number of processes is within an allowable range for the total number of processes, the coefficient information flag indicating an attribute of a coefficient included in the block, skipping encoding of the coefficient information flag when the total number of processes is not within the allowable range for the total number of processes, encoding remainder value information by Golomb-rice coding when the coefficient information flag is encoded, the remainder value information being for reconstructing a value of the coefficient using the coefficient information flag, when the encoding of the coefficient information flag is skipped in the case where orthogonal transform is applied to the block, performing a conversion process for converting the value of the coefficient using a value determined using a neighboring coefficient which is a coefficient that neighbors a position of the coefficient in the block, and encoding the value of the coefficient by Golomb-rice coding, and when the encoding of the coefficient information flag is skipped in the case where no orthogonal transform is applied to the block, skipping performing the conversion process, and encoding the value of the coefficient by Golomb-rice coding.

Furthermore, for example, the program may cause a computer to execute a decoding method including: limiting a total number of processes of context adaptive decoding, and decoding a block in an image; and in the decoding of the block: in both a case where inverse orthogonal transform is applied to the block, and a case where no inverse orthogonal transform is applied to the block, decoding a coefficient information flag by context adaptive decoding when the total number of processes is within an allowable range for the total number of processes, the coefficient information flag indicating an attribute of a coefficient included in the block, skipping decoding of the coefficient information flag when the total number of processes is not within the allowable range for the total number of processes, decoding remainder value information by Golomb-rice decoding when the coefficient information flag is decoded, the remainder value information being for reconstructing a value of the coefficient using the coefficient information flag, and deriving the value of the coefficient using the coefficient information flag and the remainder value information, when the decoding of the coefficient information flag is skipped in the case where inverse orthogonal transform is applied to the block, decoding the value of the coefficient by Golomb-rice decoding, performing a conversion process for converting the value of the coefficient using a value determined using a neighboring coefficient which is a coefficient that neighbors a position of the coefficient in the block, and deriving the value of the coefficient, and when the decoding of the coefficient information flag is skipped in the case where no inverse orthogonal transform is applied to the block, decoding the value of the coefficient by Golomb-rice decoding, skipping performing the conversion process, and deriving the value of the coefficient by Golomb-rice decoding.

In addition, each constituent element may be circuitry as described above. Circuits may compose circuitry as a whole, or may be separate circuits. Alternatively, each constituent element may be implemented as a general processor, or may be implemented as an exclusive processor.

In addition, the process that is executed by a particular constituent element may be executed by another constituent element. In addition, the processing execution order may be modified, or a plurality of processes may be executed in parallel. In addition, an encoder and decoder may include encoder 100 and decoder 200.

In addition, the ordinal numbers such as “first” and “second” used for explanation may be changed appropriately. A new ordinal number may be attached to a constituent element, or an ordinal number attached to a constituent element may be removed.

Although aspects of encoder 100 and decoder 200 have been described based on a plurality of examples, aspects of encoder 100 and decoder 200 are not limited to these examples. The scope of the aspects of encoder 100 and decoder 200 may encompass embodiments obtainable by adding, to any of these embodiments, various kinds of modifications that a person skilled in the art would arrive at without deviating from the scope of the present disclosure and embodiments configurable by combining constituent elements in different embodiments.

One or more of the aspects disclosed herein may be performed by combining at least part of the other aspects in the present disclosure. In addition, one or more of the aspects disclosed herein may be performed by combining, with other aspects, part of the processes indicated in any of the flow charts according to the aspects, part of the configuration of any of the devices, part of syntaxes, etc.

[Implementations and Applications]

As described in each of the above embodiments, each functional or operational block may typically be realized as an MPU (micro processing unit) and memory, for example. Moreover, processes performed by each of the functional blocks may be realized as a program execution unit, such as a processor which reads and executes software (a program) recorded on a recording medium such as ROM. The software may be distributed. The software may be recorded on a variety of recording media such as semiconductor memory. Note that each functional block can also be realized as hardware (dedicated circuit). Various combinations of hardware and software may be employed.

The processing described in each of the embodiments may be realized via integrated processing using a single apparatus (system), and, alternatively, may be realized via decentralized processing using a plurality of apparatuses. Moreover, the processor that executes the above-described program may be a single processor or a plurality of processors. In other words, integrated processing may be performed, and, alternatively, decentralized processing may be performed.

Embodiments of the present disclosure are not limited to the above exemplary embodiments; various modifications may be made to the exemplary embodiments, the results of which are also included within the scope of the embodiments of the present disclosure.

Next, application examples of the moving picture encoding method (image encoding method) and the moving picture decoding method (image decoding method) described in each of the above embodiments will be described, as well as various systems that implement the application examples. Such a system may be characterized as including an image encoder that employs the image encoding method, an image decoder that employs the image decoding method, or an image encoder-decoder that includes both the image encoder and the image decoder. Other configurations of such a system may be modified on a case-by-case basis.

Usage Examples

FIG. 72 illustrates an overall configuration of content providing system ex100 suitable for implementing a content distribution service. The area in which the communication service is provided is divided into cells of desired sizes, and base stations ex106, ex107, ex108, ex109, and ex110, which are fixed wireless stations in the illustrated example, are located in respective cells.

In content providing system ex100, devices including computer ex111, gaming device ex112, camera ex113, home appliance ex114, and smartphone ex115 are connected to internet ex101 via internet service provider ex102 or communications network ex104 and base stations ex106 through ex110. Content providing system ex100 may combine and connect any combination of the above devices. In various implementations, the devices may be directly or indirectly connected together via a telephone network or near field communication, rather than via base stations ex106 through ex110. Further, streaming server ex103 may be connected to devices including computer ex111, gaming device ex112, camera ex113, home appliance ex114, and smartphone ex115 via, for example, internet ex101. Streaming server ex103 may also be connected to, for example, a terminal in a hotspot in airplane ex117 via satellite ex116.

Note that instead of base stations ex106 through ex110, wireless access points or hotspots may be used. Streaming server ex103 may be connected to communications network ex104 directly instead of via internet ex101 or internet service provider ex102, and may be connected to airplane ex117 directly instead of via satellite ex116.

Camera ex113 is a device capable of capturing still images and video, such as a digital camera. Smartphone ex115 is a smartphone device, cellular phone, or personal handy-phone system (PHS) phone that can operate under the mobile communications system standards of the 2G, 3G, 3.9G, and 4G systems, as well as the next-generation 5G system.

Home appliance ex114 is, for example, a refrigerator or a device included in a home fuel cell cogeneration system.

In content providing system ex100, a terminal including an image and/or video capturing function is capable of, for example, live streaming by connecting to streaming server ex103 via, for example, base station ex106. When live streaming, a terminal (e.g., computer ex111, gaming device ex112, camera ex113, home appliance ex114, smartphone ex115, or a terminal in airplane ex117) may perform the encoding processing described in the above embodiments on still-image or video content captured by a user via the terminal, may multiplex video data obtained via the encoding and audio data obtained by encoding audio corresponding to the video, and may transmit the obtained data to streaming server ex103. In other words, the terminal functions as the image encoder according to one aspect of the present disclosure.

Streaming server ex103 streams transmitted content data to clients that request the stream. Client examples include computer ex111, gaming device ex112, camera ex113, home appliance ex114, smartphone ex115, and terminals inside airplane ex117, which are capable of decoding the above-described encoded data. Devices that receive the streamed data may decode and reproduce the received data. In other words, the devices may each function as the image decoder, according to one aspect of the present disclosure.

[Decentralized Processing]

Streaming server ex103 may be realized as a plurality of servers or computers between which tasks such as the processing, recording, and streaming of data are divided. For example, streaming server ex103 may be realized as a content delivery network (CDN) that streams content via a network connecting multiple edge servers located throughout the world. In a CDN, an edge server physically near the client may be dynamically assigned to the client. Content is cached and streamed to the edge server to reduce load times. In the event of, for example, some type of error or change in connectivity due, for example, to a spike in traffic, it is possible to stream data stably at high speeds, since it is possible to avoid affected parts of the network by, for example, dividing the processing between a plurality of edge servers, or switching the streaming duties to a different edge server and continuing streaming.

Decentralization is not limited to just the division of processing for streaming; the encoding of the captured data may be divided between and performed by the terminals, on the server side, or both. In one example, in typical encoding, the processing is performed in two loops. The first loop is for detecting how complicated the image is on a frame-by-frame or scene-by-scene basis, or detecting the encoding load. The second loop is for processing that maintains image quality and improves encoding efficiency. For example, it is possible to reduce the processing load of the terminals and improve the quality and encoding efficiency of the content by having the terminals perform the first loop of the encoding and having the server side that received the content perform the second loop of the encoding. In such a case, upon receipt of a decoding request, it is possible for the encoded data resulting from the first loop performed by one terminal to be received and reproduced on another terminal in approximately real time. This makes it possible to realize smooth, real-time streaming.

In another example, camera ex113 or the like extracts a feature amount (an amount of features or characteristics) from an image, compresses data related to the feature amount as metadata, and transmits the compressed metadata to a server. For example, the server determines the significance of an object based on the feature amount and changes the quantization accuracy accordingly to perform compression suitable for the meaning (or content significance) of the image. Feature amount data is particularly effective in improving the precision and efficiency of motion vector prediction during the second compression pass performed by the server. Moreover, encoding that has a relatively low processing load, such as variable length coding (VLC), may be handled by the terminal, and encoding that has a relatively high processing load, such as context-adaptive binary arithmetic coding (CABAC), may be handled by the server.

In yet another example, there are instances in which a plurality of videos of approximately the same scene are captured by a plurality of terminals in, for example, a stadium, shopping mall, or factory. In such a case, for example, the encoding may be decentralized by dividing processing tasks between the plurality of terminals that captured the videos and, if necessary, other terminals that did not capture the videos, and the server, on a per-unit basis. The units may be, for example, groups of pictures (GOP), pictures, or tiles resulting from dividing a picture. This makes it possible to reduce load times and achieve streaming that is closer to real time.

Since the videos are of approximately the same scene, management and/or instructions may be carried out by the server so that the videos captured by the terminals can be cross-referenced. Moreover, the server may receive encoded data from the terminals, change the reference relationship between items of data, or correct or replace pictures themselves, and then perform the encoding. This makes it possible to generate a stream with increased quality and efficiency for the individual items of data.

Furthermore, the server may stream video data after performing transcoding to convert the encoding format of the video data. For example, the server may convert the encoding format from MPEG to VP (e.g., VP9), may convert H.264 to H.265, etc.

In this way, encoding can be performed by a terminal or one or more servers. Accordingly, although the device that performs the encoding is referred to as a “server” or “terminal” in the following description, some or all of the processes performed by the server may be performed by the terminal, and likewise some or all of the processes performed by the terminal may be performed by the server. This also applies to decoding processes.

[3D, Multi-Angle]

There has been an increase in usage of images or videos combined from images or videos of different scenes concurrently captured, or of the same scene captured from different angles, by a plurality of terminals such as camera ex113 and/or smartphone ex115. Videos captured by the terminals may be combined based on, for example, the separately obtained relative positional relationship between the terminals, or regions in a video having matching feature points.

In addition to the encoding of two-dimensional moving pictures, the server may encode a still image based on scene analysis of a moving picture, either automatically or at a point in time specified by the user, and transmit the encoded still image to a reception terminal. Furthermore, when the server can obtain the relative positional relationship between the video capturing terminals, in addition to two-dimensional moving pictures, the server can generate three-dimensional geometry of a scene based on video of the same scene captured from different angles. The server may separately encode three-dimensional data generated from, for example, a point cloud and, based on a result of recognizing or tracking a person or object using three-dimensional data, may select or reconstruct and generate a video to be transmitted to a reception terminal, from videos captured by a plurality of terminals.

This allows the user to enjoy a scene by freely selecting videos corresponding to the video capturing terminals, and allows the user to enjoy the content obtained by extracting a video at a selected viewpoint from three-dimensional data reconstructed from a plurality of images or videos. Furthermore, as with video, sound may be recorded from relatively different angles, and the server may multiplex audio from a specific angle or space with the corresponding video, and transmit the multiplexed video and audio.

In recent years, content that is a composite of the real world and a virtual world, such as virtual reality (VR) and augmented reality (AR) content, has also become popular. In the case of VR images, the server may create images from the viewpoints of both the left and right eyes, and perform encoding that tolerates reference between the two viewpoint images, such as multi-view coding (MVC), and, alternatively, may encode the images as separate streams without referencing. When the images are decoded as separate streams, the streams may be synchronized when reproduced, so as to recreate a virtual three-dimensional space in accordance with the viewpoint of the user.

In the case of AR images, the server may superimpose virtual object information existing in a virtual space onto camera information representing a real-world space, based on a three-dimensional position or movement from the perspective of the user. The decoder may obtain or store virtual object information and three-dimensional data, generate two-dimensional images based on movement from the perspective of the user, and then generate superimposed data by seamlessly connecting the images. Alternatively, the decoder may transmit, to the server, motion from the perspective of the user in addition to a request for virtual object information. The server may generate superimposed data based on three-dimensional data stored in the server in accordance with the received motion, and encode and stream the generated superimposed data to the decoder. Note that superimposed data typically includes, in addition to RGB values, an α value indicating transparency, and the server sets the α value for sections other than the object generated from three-dimensional data to, for example, 0, and may perform the encoding while those sections are transparent. Alternatively, the server may set the background to a determined RGB value, such as a chroma key, and generate data in which areas other than the object are set as the background. The determined RGB value may be predetermined.

Decoding of similarly streamed data may be performed by the client (e.g., the terminals), on the server side, or divided therebetween. In one example, one terminal may transmit a reception request to a server, the requested content may be received and decoded by another terminal, and a decoded signal may be transmitted to a device having a display. It is possible to reproduce high image quality data by decentralizing processing and appropriately selecting content regardless of the processing ability of the communications terminal itself. In yet another example, while a TV, for example, is receiving image data that is large in size, a region of a picture, such as a tile obtained by dividing the picture, may be decoded and displayed on a personal terminal or terminals of a viewer or viewers of the TV. This makes it possible for the viewers to share a big-picture view as well as for each viewer to check his or her assigned area, or inspect a region in further detail up close.

In situations in which a plurality of wireless connections are possible over near, mid, and far distances, indoors or outdoors, it may be possible to seamlessly receive content using a streaming system standard such as Dynamic Adaptive Streaming over HTTP (MPEG-DASH). The user may switch between data in real time while freely selecting a decoder or display apparatus including the user's terminal, displays arranged indoors or outdoors, etc. Moreover, using, for example, information on the position of the user, decoding can be performed while switching which terminal handles decoding and which terminal handles the displaying of content. This makes it possible to map and display information, while the user is on the move in route to a destination, on the wall of a nearby building in which a device capable of displaying content is embedded, or on part of the ground. Moreover, it is also possible to switch the bit rate of the received data based on the accessibility to the encoded data on a network, such as when encoded data is cached on a server quickly accessible from the reception terminal, or when encoded data is copied to an edge server in a content delivery service.

[Scalable Encoding]

The switching of content will be described with reference to a scalable stream, illustrated in FIG. 73, which is compression coded via implementation of the moving picture encoding method described in the above embodiments. The server may have a configuration in which content is switched while making use of the temporal and/or spatial scalability of a stream, which is achieved by division into and encoding of layers, as illustrated in FIG. 73. Note that there may be a plurality of individual streams that are of the same content but different quality. In other words, by determining which layer to decode based on internal factors, such as the processing ability on the decoder side, and external factors, such as communication bandwidth, the decoder side can freely switch between low resolution content and high resolution content while decoding. For example, in a case in which the user wants to continue watching, for example at home on a device such as a TV connected to the internet, a video that the user had been previously watching on smartphone ex115 while on the move, the device can simply decode the same stream up to a different layer, which reduces the server side load.

Furthermore, in addition to the configuration described above, in which scalability is achieved as a result of the pictures being encoded per layer, with the enhancement layer being above the base layer, the enhancement layer may include metadata based on, for example, statistical information on the image. The decoder side may generate high image quality content by performing super-resolution imaging on a picture in the base layer based on the metadata. Super-resolution imaging may improve the Signal-to-Noise (SN) ratio while maintaining resolution and/or increasing resolution. Metadata includes information for identifying a linear or a non-linear filter coefficient, as used in super-resolution processing, or information identifying a parameter value in filter processing, machine learning, or a least squares method used in super-resolution processing.

Alternatively, a configuration may be provided in which a picture is divided into, for example, tiles in accordance with, for example, the meaning of an object in the image. On the decoder side, only a partial region is decoded by selecting a tile to decode. Further, by storing an attribute of the object (person, car, ball, etc.) and a position of the object in the video (coordinates in identical images) as metadata, the decoder side can identify the position of a desired object based on the metadata and determine which tile or tiles include that object. For example, as illustrated in FIG. 74, metadata may be stored using a data storage structure different from pixel data, such as an SEI (supplemental enhancement information) message in HEVC. This metadata indicates, for example, the position, size, or color of the main object.

Metadata may be stored in units of a plurality of pictures, such as stream, sequence, or random access units. The decoder side can obtain, for example, the time at which a specific person appears in the video, and by fitting the time information with picture unit information, can identify a picture in which the object is present, and can determine the position of the object in the picture.

[Web Page Optimization]

FIG. 75 illustrates an example of a display screen of a web page on computer ex111, for example. FIG. 76 illustrates an example of a display screen of a web page on smartphone ex115, for example. As illustrated in FIG. 75 and FIG. 76, a web page may include a plurality of image links that are links to image content, and the appearance of the web page may differ depending on the device used to view the web page. When a plurality of image links are viewable on the screen, until the user explicitly selects an image link, or until the image link is in the approximate center of the screen or the entire image link fits in the screen, the display apparatus (decoder) may display, as the image links, still images included in the content or I pictures; may display video such as an animated gif using a plurality of still images or I pictures; or may receive only the base layer, and decode and display the video.

When an image link is selected by the user, the display apparatus performs decoding while, for example, giving the highest priority to the base layer. Note that if there is information in the HyperText Markup Language (HTML) code of the web page indicating that the content is scalable, the display apparatus may decode up to the enhancement layer. Further, in order to guarantee real-time reproduction, before a selection is made or when the bandwidth is severely limited, the display apparatus can reduce delay between the point in time at which the leading picture is decoded and the point in time at which the decoded picture is displayed (that is, the delay between the start of the decoding of the content to the displaying of the content) by decoding and displaying only forward reference pictures (I picture, P picture, forward reference B picture). Still further, the display apparatus may purposely ignore the reference relationship between pictures, and coarsely decode all B and P pictures as forward reference pictures, and then perform normal decoding as the number of pictures received over time increases.

[Autonomous Driving]

When transmitting and receiving still image or video data such as two- or three-dimensional map information for autonomous driving or assisted driving of an automobile, the reception terminal may receive, in addition to image data belonging to one or more layers, information on, for example, the weather or road construction as metadata, and associate the metadata with the image data upon decoding. Note that metadata may be assigned per layer and, alternatively, may simply be multiplexed with the image data.

In such a case, since the automobile, drone, airplane, etc., containing the reception terminal is mobile, the reception terminal may seamlessly receive and perform decoding while switching between base stations among base stations ex106 through ex110 by transmitting information indicating the position of the reception terminal. Moreover, in accordance with the selection made by the user, the situation of the user, and/or the bandwidth of the connection, the reception terminal may dynamically select to what extent the metadata is received, or to what extent the map information, for example, is updated.

In content providing system ex100, the client may receive, decode, and reproduce, in real time, encoded information transmitted by the user.

[Streaming of Individual Content]

In content providing system ex100, in addition to high image quality, long content distributed by a video distribution entity, unicast or multicast streaming of low image quality, and short content from an individual are also possible. Such content from individuals is likely to further increase in popularity. The server may first perform editing processing on the content before the encoding processing, in order to refine the individual content. This may be achieved using the following configuration, for example.

In real time while capturing video or image content, or after the content has been captured and accumulated, the server performs recognition processing based on the raw data or encoded data, such as capture error processing, scene search processing, meaning analysis, and/or object detection processing. Then, based on the result of the recognition processing, the server—either when prompted or automatically—edits the content, examples of which include: correction such as focus and/or motion blur correction; removing low-priority scenes such as scenes that are low in brightness compared to other pictures, or out of focus; object edge adjustment; and color tone adjustment. The server encodes the edited data based on the result of the editing. It is known that excessively long videos tend to receive fewer views. Accordingly, in order to keep the content within a specific length that scales with the length of the original video, the server may, in addition to the low-priority scenes described above, automatically clip out scenes with low movement, based on an image processing result. Alternatively, the server may generate and encode a video digest based on a result of an analysis of the meaning of a scene.

There may be instances in which individual content may include content that infringes a copyright, moral right, portrait rights, etc. Such instance may lead to an unfavorable situation for the creator, such as when content is shared beyond the scope intended by the creator. Accordingly, before encoding, the server may, for example, edit images so as to blur faces of people in the periphery of the screen or blur the inside of a house, for example. Further, the server may be configured to recognize the faces of people other than a registered person in images to be encoded, and when such faces appear in an image, may apply a mosaic filter, for example, to the face of the person. Alternatively, as pre- or post-processing for encoding, the user may specify, for copyright reasons, a region of an image including a person or a region of the background to be processed. The server may process the specified region by, for example, replacing the region with a different image, or blurring the region. If the region includes a person, the person may be tracked in the moving picture, and the person's head region may be replaced with another image as the person moves.

Since there is a demand for real-time viewing of content produced by individuals, which tends to be small in data size, the decoder may first receive the base layer as the highest priority, and perform decoding and reproduction, although this may differ depending on bandwidth. When the content is reproduced two or more times, such as when the decoder receives the enhancement layer during decoding and reproduction of the base layer, and loops the reproduction, the decoder may reproduce a high image quality video including the enhancement layer. If the stream is encoded using such scalable encoding, the video may be low quality when in an unselected state or at the start of the video, but it can offer an experience in which the image quality of the stream progressively increases in an intelligent manner. This is not limited to just scalable encoding; the same experience can be offered by configuring a single stream from a low quality stream reproduced for the first time and a second stream encoded using the first stream as a reference.

[Other Implementation and Application Examples]

The encoding and decoding may be performed by LSI (large scale integration circuitry) ex500 (see FIG. 72), which is typically included in each terminal. LSI ex500 may be configured of a single chip or a plurality of chips. Software for encoding and decoding moving pictures may be integrated into some type of a recording medium (such as a CD-ROM, a flexible disk, or a hard disk) that is readable by, for example, computer ex111, and the encoding and decoding may be performed using the software. Furthermore, when smartphone ex115 is equipped with a camera, the video data obtained by the camera may be transmitted. In this case, the video data may be coded by LSI ex500 included in smartphone ex115.

Note that LSI ex500 may be configured to download and activate an application. In such a case, the terminal first determines whether it is compatible with the scheme used to encode the content, or whether it is capable of executing a specific service. When the terminal is not compatible with the encoding scheme of the content, or when the terminal is not capable of executing a specific service, the terminal may first download a codec or application software and then obtain and reproduce the content.

Aside from the example of content providing system ex100 that uses internet ex101, at least the moving picture encoder (image encoder) or the moving picture decoder (image decoder) described in the above embodiments may be implemented in a digital broadcasting system. The same encoding processing and decoding processing may be applied to transmit and receive broadcast radio waves superimposed with multiplexed audio and video data using, for example, a satellite, even though this is geared toward multicast, whereas unicast is easier with content providing system ex100.

[Hardware Configuration]

FIG. 77 illustrates further details of smartphone ex115 shown in FIG. 72. FIG. 78 illustrates a configuration example of smartphone ex115. Smartphone ex115 includes antenna ex450 for transmitting and receiving radio waves to and from base station ex110, camera ex465 capable of capturing video and still images, and display ex458 that displays decoded data, such as video captured by camera ex465 and video received by antenna ex450. Smartphone ex115 further includes user interface ex466 such as a touch panel, audio output unit ex457 such as a speaker for outputting speech or other audio, audio input unit ex456 such as a microphone for audio input, memory ex467 capable of storing decoded data such as captured video or still images, recorded audio, received video or still images, and mail, as well as decoded data, and slot ex464 which is an interface for Subscriber Identity Module (SIM) ex468 for authorizing access to a network and various data. Note that external memory may be used instead of memory ex467.

Main controller ex460, which may comprehensively control display ex458 and user interface ex466, power supply circuit ex461, user interface input controller ex462, video signal processor ex455, camera interface ex463, display controller ex459, modulator/demodulator ex452, multiplexer/demultiplexer ex453, audio signal processor ex454, slot ex464, and memory ex467 are connected via bus ex470.

When the user turns on the power button of power supply circuit ex461, smartphone ex115 is powered on into an operable state, and each component is supplied with power from a battery pack.

Smartphone ex115 performs processing for, for example, calling and data transmission, based on control performed by main controller ex460, which includes a CPU, ROM, and RAM. When making calls, an audio signal recorded by audio input unit ex456 is converted into a digital audio signal by audio signal processor ex454, to which spread spectrum processing is applied by modulator/demodulator ex452 and digital-analog conversion, and frequency conversion processing is applied by transmitter/receiver ex451, and the resulting signal is transmitted via antenna ex450. The received data is amplified, frequency converted, and analog-digital converted, inverse spread spectrum processed by modulator/demodulator ex452, converted into an analog audio signal by audio signal processor ex454, and then output from audio output unit ex457. In data transmission mode, text, still-image, or video data may be transmitted under control of main controller ex460 via user interface input controller ex462 based on operation of user interface ex466 of the main body, for example. Similar transmission and reception processing is performed. In data transmission mode, when sending a video, still image, or video and audio, video signal processor ex455 compression encodes, via the moving picture encoding method described in the above embodiments, a video signal stored in memory ex467 or a video signal input from camera ex465, and transmits the encoded video data to multiplexer/demultiplexer ex453. Audio signal processor ex454 encodes an audio signal recorded by audio input unit ex456 while camera ex465 is capturing a video or still image, and transmits the encoded audio data to multiplexer/demultiplexer ex453.

Multiplexer/demultiplexer ex453 multiplexes the encoded video data and encoded audio data using a determined scheme, modulates and converts the data using modulator/demodulator (modulator/demodulator circuit) ex452 and transmitter/receiver ex451, and transmits the result via antenna ex450. The determined scheme may be predetermined.

When video appended in an email or a chat, or a video linked from a web page, is received, for example, in order to decode the multiplexed data received via antenna ex450, multiplexer/demultiplexer ex453 demultiplexes the multiplexed data to divide the multiplexed data into a bitstream of video data and a bitstream of audio data, supplies the encoded video data to video signal processor ex455 via synchronous bus ex470, and supplies the encoded audio data to audio signal processor ex454 via synchronous bus ex470. Video signal processor ex455 decodes the video signal using a moving picture decoding method corresponding to the moving picture encoding method described in the above embodiments, and video or a still image included in the linked moving picture file is displayed on display ex458 via display controller ex459. Audio signal processor ex454 decodes the audio signal and outputs audio from audio output unit ex457. Since real-time streaming is becoming increasingly popular, there may be instances in which reproduction of the audio may be socially inappropriate, depending on the user's environment. Accordingly, as an initial value, a configuration in which only video data is reproduced, i.e., the audio signal is not reproduced, may be preferable; audio may be synchronized and reproduced only when an input, such as when the user clicks video data, is received.

Although smartphone ex115 was used in the above example, other implementations are conceivable: a transceiver terminal including both an encoder and a decoder; a transmitter terminal including only an encoder; and a receiver terminal including only a decoder. In the description of the digital broadcasting system, an example is given in which multiplexed data obtained as a result of video data being multiplexed with audio data is received or transmitted. The multiplexed data, however, may be video data multiplexed with data other than audio data, such as text data related to the video. Further, the video data itself rather than multiplexed data may be received or transmitted.

Although main controller ex460 including a CPU is described as controlling the encoding or decoding processes, various terminals often include Graphics Processing Units (GPUs). Accordingly, a configuration is acceptable in which a large area is processed at once by making use of the performance ability of the GPU via memory shared by the CPU and GPU, or memory including an address that is managed so as to allow common usage by the CPU and GPU. This makes it possible to shorten encoding time, maintain the real-time nature of the stream, and reduce delay. In particular, processing relating to motion estimation, deblocking filtering, sample adaptive offset (SAO), and transformation/quantization can be effectively carried out by the GPU instead of the CPU in units of pictures, for example, all at once.

Although only some exemplary embodiments of the present disclosure have been described in detail above, those skilled in the art will readily appreciate that many modifications are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of the present disclosure. Accordingly, all such modifications are intended to be included within the scope of the present disclosure.

INDUSTRIAL APPLICABILITY

The present disclosure is applicable to, for example, television receivers, digital video recorders, car navigation systems, mobile phones, digital cameras, digital video cameras, teleconferencing systems, electronic mirrors, etc. 

What is claimed is:
 1. An encoder comprising: circuitry; and memory coupled to the circuitry, wherein: in both of a first case where an orthogonal transform is performed and a second case where the orthogonal transform is skipped in residual coding of a current block, when a number of Context-based Adaptive Binary Arithmetic Coding (CABAC) processes is within an allowable range, the circuitry: encodes a plurality of coefficient information flags by CABAC, each of the plurality of coefficient information flags relating to a coefficient included in the current block; and encodes a remainder value of the coefficient with Golomb-Rice code; and when the number of CABAC processes is not within the allowable range, the circuitry: skips the encoding of the plurality of coefficient information flags, wherein in the first case where the orthogonal transform is performed, the circuitry: converts the coefficient to a second coefficient by using a poszero value that is determined using a plurality of surrounding coefficients of the coefficient within the current block; and encodes a value of the second coefficient with the Golomb-Rice code, and wherein in the second case where the orthogonal transform is skipped, the circuitry: encodes the value of the coefficient with the Golomb-Rice code.
 2. The encoder according to claim 1, wherein the poszero value is determined based on a sum of absolute values of the plurality of surrounding coefficients.
 3. The encoder according to claim 1, wherein in the conversion of the coefficient, when the value of the coefficient is zero, the value of the second coefficient is equal to the poszero value, when an absolute value of the coefficient is equal to or smaller than the poszero value, the value of the second coefficient is a value obtained by subtracting one from the absolute value of the coefficient, and when the absolute value of the coefficient is larger than the poszero value, the value of the second coefficient is equal to the absolute value of the coefficient.
 4. The encoder according to claim 1, wherein the plurality of coefficient information flags include: a first flag indicating whether the value of the coefficient is zero or non-zero; a second flag indicating whether an absolute value of the coefficient is greater than a certain value; and a third flag indicating whether the coefficient is an odd number or an even number.
 5. The encoder according to claim 1, wherein the current block includes a plurality of coefficients, and wherein the encoding of the plurality of coefficient information flags and the remainder value, or, the encoding of the value of the coefficient or the value of the second coefficient is performed for each of the plurality of coefficients.
 6. The encoder according to claim 1, wherein the remainder value is a value to be used with the plurality of coefficient information flags to reconstruct the value of the coefficient.
 7. An encoding method, in both of a first case where an orthogonal transform is performed and a second case where the orthogonal transform is skipped in residual coding of a current block, when a number of Context-based Adaptive Binary Arithmetic Coding (CABAC) processes is within an allowable range, the encoding method comprising: encoding a plurality of coefficient information flags by CABAC, each of the plurality of coefficient information flags relating to a coefficient included in the current block; and encoding a remainder value of the coefficient with Golomb-Rice code; and when the number of CABAC processes is not within the allowable range, the encoding method comprising: skipping the encoding of the plurality of coefficient information flags, wherein in the first case where the orthogonal transform is performed, the encoding method further comprising: converting the coefficient to a second coefficient by using a poszero value that is determined using a plurality of surrounding coefficients of the coefficient within the current block; and encoding a value of the second coefficient with the Golomb-Rice code, and wherein in the second case where the orthogonal transform is skipped, the encoding method further comprising: encoding the value of the coefficient with the Golomb-Rice code.
 8. The encoding method according to claim 7, wherein the poszero value is determined based on a sum of absolute values of the plurality of surrounding coefficients.
 9. The encoding method according to claim 7, wherein in the converting of the coefficient, when the value of the coefficient is zero, the value of the second coefficient is equal to the poszero value, when an absolute value of the coefficient is equal to or smaller than the poszero value, the value of the second coefficient is a value obtained by subtracting one from the absolute value of the coefficient, and when the absolute value of the coefficient is larger than the poszero value, the value of the second coefficient is equal to the absolute value of the coefficient.
 10. The encoding method according to claim 7, wherein the plurality of coefficient information flags include: a first flag indicating whether the value of the coefficient is zero or non-zero; a second flag indicating whether an absolute value of the coefficient is greater than a certain value; and a third flag indicating whether the coefficient is an odd number or an even number.
 11. The encoding method according to claim 7, wherein the current block includes a plurality of coefficients, and wherein the encoding of the plurality of coefficient information flags and the remainder value, or, the encoding of the value of the coefficient or the value of the second coefficient is performed for each of the plurality of coefficients.
 12. The encoding method according to claim 7, wherein the remainder value is a value to be used with the plurality of coefficient information flags to reconstruct the value of the coefficient. 